Sciweavers

5606 search results - page 468 / 1122
» Randomization Techniques for Graphs.
Sort
View
DCC
2009
IEEE
16 years 7 months ago
Compressive-Projection Principal Component Analysis and the First Eigenvector
An analysis is presented that extends existing Rayleigh-Ritz theory to the special case of highly eccentric distributions. Specifically, a bound on the angle between the first Rit...
James E. Fowler
DCC
2007
IEEE
16 years 6 months ago
Quantization of Sparse Representations
Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with rand...
Petros Boufounos, Richard G. Baraniuk
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
16 years 4 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski
SIGMETRICS
2005
ACM
104views Hardware» more  SIGMETRICS 2005»
16 years 11 days ago
Message delay in MANET
A generic stochastic model with only two input parameters is introduced to evaluate the message delay in mobile ad hoc networks (MANETs) where nodes may relay messages. The Laplac...
Robin Groenevelt, Philippe Nain, Ger Koole
149
Voted
ICALP
2005
Springer
16 years 9 days ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak