Sciweavers

5115 search results - page 459 / 1023
» On Randomized Lanczos Algorithms
Sort
View
STOC
2002
ACM
96views Algorithms» more  STOC 2002»
16 years 8 months ago
Near-optimal sparse fourier representations via sampling
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Mut...
CDC
2008
IEEE
130views Control Systems» more  CDC 2008»
16 years 2 months ago
Stochastic multiscale approaches to consensus problems
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...
FOCI
2007
IEEE
16 years 2 months ago
Simulated Annealing with Opposite Neighbors
— This paper presents an improvement to the vanilla version of the simulated annealing algorithm by using opposite neighbors. This new technique, is based on the recently propose...
Mario Ventresca, Hamid R. Tizhoosh
ICCCN
2007
IEEE
16 years 2 months ago
Interleaving Techniques for W-CDMA Linear Equalization Receivers
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
João Carlos Silva, Rui Dinis, Nuno Souto, F...
ICRA
2007
IEEE
144views Robotics» more  ICRA 2007»
16 years 1 months ago
Particle RRT for Path Planning with Uncertainty
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
Nik A. Melchior, Reid G. Simmons