SODA
2003
ACM
14 years 1 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
SODA
2003
ACM
14 years 1 months ago
2003
ACM
SODA
2003
ACM
14 years 1 months ago
2003
ACM
SODA
2003
ACM
14 years 1 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
SODA
2003
ACM
14 years 1 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
SODA
2003
ACM
14 years 1 months ago
2003
ACM
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...
SODA
2003
ACM
14 years 1 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
ACL
1998
14 years 1 months ago
1998
We present an architecture and an on-line learning algorithm and apply it to the problem of part-ofspeech tagging. The architecture presented, SNOW, is a network of linear separat...
AAAI
2000
14 years 1 months ago
2000
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...