139 search results - page 17 / 28 » Computing crossing numbers in quadratic time |
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
A mechanism for efficient mean-shift belief propagation (MSBP) is introduced. The novelty of our work is to use mean-shift to perform nonparametric mode-seeking on belief surfaces...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
COCOON
2006
Springer
14 years 10 days ago
2006
Springer
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
SIGMOD
2000
ACM
14 years 29 days ago
2000
ACM
We discovered a surprising law governing the spatial join selectivity across two sets of points. An example of such a spatial join is "find the libraries that are within 10 m...