7930 search results - page 1220 / 1586 » Greedy in Approximation Algorithms |
164
click to vote
WADS
2005
Springer
16 years 6 days ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
191
click to vote
WAOA
2005
Springer
16 years 6 days ago
2005
Springer
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
233
click to vote
SIGIR
2004
ACM
16 years 4 days ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
161
click to vote
AIRS
2004
Springer
16 years 3 days ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
169
click to vote
CIKM
2004
Springer
16 years 3 days ago
2004
Springer
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...