Sciweavers

185 search results - page 18 / 37
» Discrete online TSP
Sort
View
DRR
2004
13 years 10 months ago
Retrieving topical sentiments from online document collections
Retrieving documents by subject matter is the general goal of information retrieval and other content access systems. There are other aspects of textual content, however, which fo...
Matthew F. Hurst, Kamal Nigam
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 4 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
TSP
2010
13 years 2 months ago
On the shiftability of dual-tree complex wavelet transforms
The dual-tree complex wavelet transform (DT- WT) is known to exhibit better shift-invariance than the conventional discrete wavelet transform. We propose an amplitude-phase represe...
Kunal Narayan Chaudhury, Michael Unser
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 7 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar