4843 search results - page 767 / 969 » The Shortcut Problem - Complexity and Approximation |
133
Voted
WWW
2003
ACM
16 years 4 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...
138
click to vote
STOC
2009
ACM
16 years 4 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...
136
Voted
KDD
2009
ACM
16 years 4 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 ...
158
click to vote
KDD
2008
ACM
16 years 3 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...
187
Voted
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...