3874 search results - page 689 / 775 » Approximation Algorithms for k-hurdle Problems |
135
click to vote
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 ...
157
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...
124
Voted
ICDE
2009
IEEE
15 years 10 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...
109
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically se...
139
click to vote
SSDBM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...