113 search results - page 11 / 23 » Improved Approximation for the Directed Spanner Problem |
109
click to vote
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
115
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
CPM
2004
Springer
15 years 5 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
112
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
DAC
1996
ACM
15 years 3 months ago
1996
ACM
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...