166 search results - page 29 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
CVPR
2007
IEEE
14 years 2 months ago
2007
IEEE
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
SIGMOD
2010
ACM
14 years 15 days ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
VIS
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
CRV
2008
IEEE
14 years 2 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...