3208 search results - page 161 / 642 » A Lower Bound for Primality |
178
click to vote
DAM
2007
15 years 6 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
157
click to vote
DAM
2007
15 years 6 months ago
2007
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
143
click to vote
RSA
2008
15 years 6 months ago
2008
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
192
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
150
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...