Sciweavers

6393 search results - page 1155 / 1279
» Randomized Algorithms on the Mesh
Sort
View
CACM
2010
104views more  CACM 2010»
13 years 10 months ago
Faster dimension reduction
Data represented geometrically in high-dimensional vector spaces can be found in many applications. Images and videos, are often represented by assigning a dimension for every pix...
Nir Ailon, Bernard Chazelle
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 10 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 10 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
CORR
2008
Springer
178views Education» more  CORR 2008»
13 years 10 months ago
Model-Based Compressive Sensing
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
Richard G. Baraniuk, Volkan Cevher, Marco F. Duart...
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 10 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
« Prev « First page 1155 / 1279 Last » Next »