16666 search results - page 3012 / 3334 » Descriptive and Computational Complexity |
193
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
230
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a new bilateral filtering algorithm with computational
complexity invariant to filter kernel size, socalled
O(1) or constant time in the literature. By showing
that a...
176
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
259
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
173
click to vote
CVPR
1998
IEEE
16 years 8 months ago
1998
IEEE
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...