Sciweavers

518 search results - page 66 / 104
» Beating a Random Assignment
Sort
View
ICCV
2009
IEEE
16 years 7 months ago
Boundary Ownership by Lifting to 2.5D
This paper addresses the “boundary ownership” problem, also known as the figure/ground assignment problem. Estimating boundary ownerships is a key step in perceptual organiz...
Ido Leichter and Michael Lindenbaum
SEMWEB
2007
Springer
15 years 8 months ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
124
Voted
FOCS
2007
IEEE
15 years 8 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
166
Voted
MM
2006
ACM
221views Multimedia» more  MM 2006»
15 years 8 months ago
Video object segmentation by motion-based sequential feature clustering
Segmentation of video foreground objects from background has many important applications, such as human computer interaction, video compression, multimedia content editing and man...
Mei Han, Wei Xu, Yihong Gong
ECML
2004
Springer
15 years 8 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...