167 search results - page 25 / 34 » On the complexity and approximation of syntenic distance |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
CGF
2006
13 years 7 months ago
2006
We present a technique for rendering reflections on complex reflectors at interactive rates based on approximating the geometry of the reflected scene with impostors. The reflecti...
JPDC
2007
13 years 7 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...