Concept

Computing

Related publications (276)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Key agreement over a radio link

Jean-Pierre Hubaux, Mario Cagalj

We present a simple, and yet powerful, technique for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol. This protocol is known to be vulnerable to the ``man-in-the-middle" attac ...

2004

Controlling Virtual Humans Using PDAs

Daniel Thalmann, Frédéric Vexo

The new breed of Personal Digital Assistants (PDA) and mobile phones have enough computing power to display 3D graphics. These new mobile devices (handhelds) have some other interesting communication and interaction possibilities as well. In this paper we ...

2003

Monitoring of Resource Consumption in Java-based Application Servers

To realize dependable and profitable information and communication systems, computing resources (CPU, memory, network bandwidth) should be taken into account to a much wider extent than they are today. E-commerce infrastructure, such as application servers ...

2003

Modified fixed point algorithm in fluid–structure interaction

Fabio Nobile, Simone Deparis, Luca Formaggia

In this work, we address the numerical solution of some non-linear problems arising in the time discretization of fluid–structure interaction problems with fully implicit schemes. At each time step, we have to solve a highly non-linear coupled system, sinc ...

2003

Moore's law and numerical modeling

Fernando Porté Agel

An estimate of the rate of increase in numerical simulation grid sizes with time is obtained by counting the grids (measured in terms of number of node points) reported in the nine volumes of an established proceedings on the numerical modeling of solidifi ...

2002

Evolution not revolution in the TCV tokamak control and acquisition system

Basil Duval, Jean-Marc Moret, Xavier Llobet, Jonathan Bryan Lister, Philippe Marmillod, Blaise Marlétaz, Pierre-François Isoz

The original TCV control system was designed in the late 1980s to be inherently network based in that all control operations were performed from X-windows terminals and the control computers were networked. Using VMS-VAX technology, the acquisition system ...

2001

Universal multimedia access from wired and wireless systems

Touradj Ebrahimi, Yousri Abdeljaoued

Personal computing and communication devices such as computers, personal digital assistants (PDAs), and mobile phones are moving to their next generation in which the end user will be able to access a multitude of information with a single device either lo ...

2001

Dynamic load balancing of parallel cellular automata

Roger Hersch, Marc Mazzariol

We are interested in running in parallel cellular automata. We present an algorithm which explores the dynamic remapping of cells in order to balance the load between processing nodes. The parallel application runs on a cluster of PCs connected by Fast-Eth ...

SPIE-Int. Soc. Opt. Eng2000

Computing Bounds for the Star Discrepancy

Eric Thiémard

We observe that the time required to compute the star discrepancy of a sequence of points in a multidimensional unit cube is prohibitive and that the best known upper bounds for the star discrepancy of (t,s)-sequences and (t,m,s)-nets are useful only for s ...

2000

Synthesizing parallel imaging applications using the CAP Computer-Aided Parallelization tool

Roger Hersch, Marc Mazzariol

Imaging applications such as filtering, image transforms and compression/decompression require vast amounts of computing power when applied to large data sets. These applications would potentially benefit from the use of parallel processing. However, dedic ...

SPIE-Int. Soc. Opt. Eng1997