6365 search results - page 842 / 1273 » Fast Local Computation Algorithms |
205
click to vote
CGF
2006
15 years 7 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
275
click to vote
ALGORITHMICA
2011
15 years 2 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
223
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
183
click to vote
CP
2005
Springer
16 years 1 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
201
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...