Sciweavers

1022 search results - page 185 / 205
» Relators and Metric Bisimulations
Sort
View
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
16 years 6 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
16 years 6 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
PERCOM
2007
ACM
16 years 5 months ago
Context Aware Routing of Enterprise User Communications
This paper develops a context aware framework to address the diverse communication needs of a modern enterprise. Such enterprises are characterized by workers in different locatio...
Munmun De Choudhury, Hari Sundaram, Ajita John, Do...
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
16 years 3 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 3 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