170 search results - page 34 / 34 » k-Wise Independent Random Graphs |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...
IJCINI
2007
13 years 5 months ago
2007
The Cognitive Processes of Abstraction and Formal Inferences J. A. Anderson: A Brain-Like Computer for Cognitive Software Applications: the Resatz Brain Project L. Flax: Cognitive ...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
Detecting moving objects using stationary cameras is an important precursor to many activity recognition, object recognition and tracking algorithms. In this paper, three innovati...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...