1439 search results - page 50 / 288 » Fast approximation of centrality |
FOCS
2010
IEEE
13 years 9 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
JGTOOLS
2008
13 years 11 months ago
2008
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
STOC
2001
ACM
14 years 11 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
ADCM
2008
13 years 11 months ago
2008
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
FSTTCS
2006
Springer
14 years 2 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...