7006 search results - page 630 / 1402 » Approximation Algorithms |
241
Voted
ESA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
198
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
190
Voted
JDA
2011
15 years 2 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
191
Voted
CVPR
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a recursive algorithm for 3D surface reconstruction based on Photometric Stereo in the presence of highlights, and self and cast shadows. We assume that the surface re...
257
Voted
FSTTCS
2001
Springer
15 years 12 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...