Sciweavers

131 search results - page 11 / 27
» Hypergraphs with independent neighborhoods
Sort
View
DAM
2008
67views more  DAM 2008»
13 years 7 months ago
On the variance of Shannon products of graphs
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
József Balogh, Clifford D. Smyth
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
13 years 7 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
RSA
2010
89views more  RSA 2010»
13 years 6 months ago
Ramsey properties of random discrete structures
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
CVPR
2007
IEEE
14 years 9 months ago
Biased Manifold Embedding: A Framework for Person-Independent Head Pose Estimation
The estimation of head pose angle from face images is an integral component of face recognition systems, human computer interfaces and other human-centered computing applications....
Vineeth Nallure Balasubramanian, Jieping Ye, Sethu...
FOCS
2008
IEEE
14 years 2 months ago
Linear Level Lasserre Lower Bounds for Certain k-CSPs
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
Grant Schoenebeck