Sciweavers

3096 search results - page 45 / 620
» The Generalized FITC Approximation
Sort
View
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 7 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
SIGCOMM
2006
ACM
14 years 2 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
SCL
2008
109views more  SCL 2008»
13 years 8 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
TCOM
2010
90views more  TCOM 2010»
13 years 7 months ago
Performance Analysis for BICM Transmission over Gaussian Mixture Noise Fading Channels
—Bit-interleaved coded modulation (BICM) has been adopted in many systems and standards for spectrally efficient coded transmission. The analytical evaluation of BICM performanc...
Alireza Kenarsari-Anhari, Lutz H.-J. Lampe
TSP
2008
129views more  TSP 2008»
13 years 7 months ago
A Basic Convergence Result for Particle Filtering
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...
Xiao-Li Hu, Thomas B. Schön, Lennart Ljung