Sciweavers

3356 search results - page 269 / 672
» Thresholds and Expectation Thresholds
Sort
View
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 6 months ago
Component structure induced by a random walk on a random graph
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
Colin Cooper, Alan M. Frieze
CORR
2010
Springer
169views Education» more  CORR 2010»
15 years 6 months ago
Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements
This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal mat...
Zvika Ben-Haim, Yonina C. Eldar
166
Voted
DCC
2010
IEEE
15 years 6 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
DAM
2008
110views more  DAM 2008»
15 years 6 months ago
Counting and enumerating aggregate classifiers
We propose a generic model for the "weighted voting" aggregation step performed by several methods in supervised classification. Further, we construct an algorithm to en...
Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Sp...
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
15 years 6 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald