Sciweavers

29 search results - page 3 / 6
» On variants of the Johnson-Lindenstrauss lemma
Sort
View
ALT
2004
Springer
14 years 4 months ago
On Kernels, Margins, and Low-Dimensional Mappings
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
Maria-Florina Balcan, Avrim Blum, Santosh Vempala
RSA
2011
126views more  RSA 2011»
13 years 2 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 7 months ago
Cauchy's Arm Lemma on a Growing Sphere
We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between ...
Zachary Abel, David Charlton, Sébastien Col...
APAL
2007
63views more  APAL 2007»
13 years 7 months ago
Bounded functional interpretation and feasible analysis
In this article we study applications of the bounded functional interpretation to theories of feasible arithmetic and analysis. The main results show that the novel interpretation...
Fernando Ferreira, Paulo Oliva
COCOON
2007
Springer
14 years 1 months ago
Can a Graph Have Distinct Regular Partitions?
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
Noga Alon, Asaf Shapira, Uri Stav