113 search results - page 18 / 23 » Improved Approximation for the Directed Spanner Problem |
103
click to vote
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
STOC
2001
ACM
15 years 12 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
134
click to vote
CVPR
2005
IEEE
15 years 1 months ago
2005
IEEE
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...
COLING
1992
15 years 23 days ago
1992
In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of ins...
115
click to vote
TON
2008
14 years 11 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...