1168 search results - page 98 / 234 » Personalized search |
152
Voted
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
153
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
135
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
140
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
131
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...