Sciweavers

11565 search results - page 270 / 2313
» Computing Minimal Mappings
Sort
View
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 11 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
IJIIDS
2008
95views more  IJIIDS 2008»
15 years 6 months ago
Tightly-coupled GIS data in GNSS fix computations with integrity testing
: Global Navigation Satellite Systems (GNSS) are often used to localise a receiver with respect to a given map. This association problem, also known as map-matching, is usually add...
Clément Fouque, Philippe Bonnifait
NA
2006
84views more  NA 2006»
15 years 6 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
SBRN
2008
IEEE
16 years 17 days ago
Imitation Learning of an Intelligent Navigation System for Mobile Robots Using Reservoir Computing
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 11 months ago
Computation of safety control for uncertain piecewise continuous systems on a partial order
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
Michael R. Hafner, Domitilla Del Vecchio