Sciweavers

371 search results - page 31 / 75
» Algorithms for the transportation problem in geometric setti...
Sort
View
FOCS
1999
IEEE
14 years 1 days ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 8 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 29 days ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
EMNLP
2011
12 years 7 months ago
Entire Relaxation Path for Maximum Entropy Problems
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
Moshe Dubiner, Yoram Singer
JMM2
2008
124views more  JMM2 2008»
13 years 7 months ago
Integrated Feature Selection and Clustering for Taxonomic Problems within Fish Species Complexes
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
Huimin Chen, Henry L. Bart Jr., Shuqing Huang