2079 search results - page 305 / 416 » Universality of random graphs |
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
164
click to vote
SAT
2010
Springer
15 years 2 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
173
click to vote
CAIP
2009
Springer
15 years 2 months ago
2009
Springer
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
158
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
128
click to vote
DCG
2006
15 years 4 months ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...