433 search results - page 13 / 87 » Generalized Ham-Sandwich Cuts |
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
SIGCSE
2006
ACM
14 years 3 months ago
2006
ACM
Plagiarism of material from the Internet is a widespread and growing problem. Computer science students, and those in other science and engineering courses, can sometimes get away...
PAMI
2007
13 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
DISOPT
2011
13 years 1 months ago
2011
In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2...
SODA
2012
ACM
12 years 4 days ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...