475 search results - page 22 / 95 » Z3-Connectivity with Independent Number 2 |
ECCV
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
PREMI
2005
Springer
14 years 3 months ago
2005
Springer
We address the problem of fusing sparse and noisy depth data obtained from a range finder with features obtained from intensity images to estimate ego-motion and refine 3D struct...
COMBINATORICS
2006
13 years 10 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
CPC
2008
13 years 10 months ago
2008
Let ai, bi, i = 0, 1, 2, . . . be drawn uniformly and independently from the unit interval, and let t be a fixed real number. Let a site (i, j) N2 be open if ai + bj t, and clos...
COMBINATORICS
2004
13 years 9 months ago
2004
For any integer r 2, define a sequence of numbers {c (r) k }k=0,1,..., independent of the parameter n, by n k=0 n k r n + k k r = n k=0 n k n + k k c (r) k , n = 0, 1, 2, . . . ....