Sciweavers

Share
7 search results - page 1 / 2
» Minors in random and expanding hypergraphs
Sort
View
COMPGEOM
2011
ACM
10 years 5 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
CORR
2010
Springer
190views Education» more  CORR 2010»
11 years 1 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
ECCC
2006
134views more  ECCC 2006»
11 years 1 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
TOC
2008
122views more  TOC 2008»
11 years 1 months ago
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
Avi Wigderson, David Xiao
ACMSE
1992
ACM
11 years 5 months ago
Visible surface ray-tracing of stereoscopic images
Ray-tracing is a well-known method for producing realistic images. If we wish to view a ray-traced image stereoscopically, we must create two distinct views of the image: a left-e...
Stephen J. Adelson, Larry F. Hodges
books