3875 search results - page 709 / 775 » Approximation algorithms for the 0-extension problem |
WWW
2003
ACM
15 years 10 months ago
2003
ACM
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
110
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
: 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...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...