1337 search results - page 12 / 268 » Fast computation of distance estimators |
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
101
click to vote
JGTOOLS
2006
14 years 9 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
51
Voted
CSMR
2003
IEEE
15 years 2 months ago
2003
IEEE
GD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...