241 search results - page 17 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
SIAMSC
2008
13 years 9 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
HICSS
2008
IEEE
13 years 9 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
EDBT
2009
ACM
14 years 25 days ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
LCN
2007
IEEE
14 years 3 months ago
2007
IEEE
—Flow correlation algorithms compare flows to determine similarity, and are especially useful and well studied for detecting flow chains through “stepping stone” hosts. Most ...
ACCV
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We design an effective shape prior embedded human silhouettes extraction algorithm. Human silhouette extraction is found challenging because of articulated structures, po...