Sciweavers

2089 search results - page 138 / 418
» A New Problem in String Searching
Sort
View
CIKM
2008
Springer
14 years 12 months ago
Mining term association patterns from search logs for effective query reformulation
Search engine logs are an emerging new type of data that offers interesting opportunities for data mining. Existing work on mining such data has mostly attempted to discover knowl...
Xuanhui Wang, ChengXiang Zhai
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
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...
Jochen Könemann, R. Ravi
CHI
2009
ACM
15 years 10 months ago
Web search and browsing behavior under poor connectivity
Web search and browsing have been streamlined for a comfortable experience when the network connection is fast. Existing tools, however, are not optimized for scenarios where conn...
Jay Chen, Lakshminarayanan Subramanian, Kentaro To...
WWW
2006
ACM
15 years 10 months ago
Retroactive answering of search queries
Major search engines currently use the history of a user's actions (e.g., queries, clicks) to personalize search results. In this paper, we present a new personalized service...
Beverly Yang, Glen Jeh
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
15 years 4 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...