Concept

Sous-programme

Publications associées (60)

Proposal strategies for joint state-space tracking with particle filters

A proposal function determines the random particle support of a particle filter. When this support is distributed close to the true target density, filter's estimation performance increases for a given number of particles. In this paper, a proposal strateg ...

2005

Defining behaviors for autonomous agents based on local perception and smart objects

Daniel Thalmann

An integrated framework is proposed in which local perception and close manipulation skills are used in conjunction with a high-level behavioral interface based on a "smart object" paradigm as support for virtual agents to perform autonomous tasks. In our ...

Elsevier2002

Optimal control of nonmodal disturbances in boundary layers

Peter Corbett

"The optimal control of infinitesimal flow disturbances experiencing the largest transient gain over a fixed time span, commonly termed ""optimal perturbations,"" is undertaken using a variational technique in two- and three-dimensional boundary layer flow ...

2001

Computing irreducible representations of supersolvable groups over small finite fields

Mohammad Amin Shokrollahi

We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the alg ...

American Mathematical Society1997

A time-domain feedback analysis of filtered-error adaptive gradient algorithms

Ali H. Sayed

This paper provides a time-domain feedback analysis of gradient-based adaptive schemes. A key emphasis is on the robustness performance of the adaptive filters in the presence of disturbances and modeling uncertainties (along the lines of H/sup /spl infin/ ...

Institute of Electrical and Electronics Engineers1996

An integrated compile-time/run-time software distributed shared memory system

Willy Zwaenepoel, Sandhya Dwarkadas

On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance of hand-coded message passing by translating data-parallel programs into mes ...

1996

The Effects of Optical Thresholding in Backpropagation Neural Networks

Sigmoid-like activation functions implemented in analog hardware differ in various ways from the standard sigmoidal function as they are asymmetric, truncated, and have a non-standard gain. It is demonstrated how one can adapt the backpropagation learning ...

EC2 & Cie1995

A recursive Schur-based solution of the four-block problem

Ali H. Sayed

We describe a new solution to the four-block problem using the method of generalized Schur analysis. We first reduce the general problem to a simpler one by invoking a coprime factorization with a block-diagonal inner matrix. Then, using convenient spectra ...

IEEE1994

Compiling Lisp Programs for Parallel Execution

James Richard Larus

Curare, the program restructurer described in this paper automatically transforms a sequential Lisp program into an equivalent concurrent program that runs on a multiprocessor. Data dependences constrain the program's concurrent execution because, in gener ...

1991

Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors

James Richard Larus

CURARE, the program restructurer described in this dissertation, automatically transforms a sequential Lisp program into an equivalent concurrent program that executes on a multiprocessor. CURARE first analyzes a program to find its control and data depend ...

Computer Science Division (EECS), University of California at Berkeley1989

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search