447 search results - page 76 / 90 » Approximation Algorithms for Directed Steiner Problems |
STOC
2001
ACM
16 years 19 hour 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...
192
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
JACM
2007
14 years 11 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
110
click to vote
VC
2011
14 years 6 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
115
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...