241 search results - page 41 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
ICCV
1998
IEEE
16 years 1 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
169
Voted
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
97
Voted
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
100
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
120
click to vote
VIS
2009
IEEE
16 years 25 days ago
2009
IEEE
This paper describes GL4D, an interactive system for visualizing 2-manifolds and 3-manifolds embedded in four Euclidean dimensions and illuminated by 4D light sources. It is a tetr...