Sciweavers

1914 search results - page 18 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
COMCOM
2011
13 years 3 months ago
Modeling gossip-based content dissemination and search in distributed networking
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and...
Siyu Tang, Eva Jaho, Ioannis Stavrakakis, Ioannis ...
SIGIR
2012
ACM
11 years 11 months ago
Mining query subtopics from search log data
Most queries in web search are ambiguous and multifaceted. Identifying the major senses and facets of queries from search log data, referred to as query subtopic mining in this pa...
Yunhua Hu, Ya-nan Qian, Hang Li, Daxin Jiang, Jian...
ICML
2003
IEEE
14 years 9 months ago
Stochastic Local Search in k-Term DNF Learning
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
Stefan Kramer, Ulrich Rückert
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 6 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
WEBI
2005
Springer
14 years 1 months ago
Adding the Temporal Dimension to Search - A Case Study in Publication Search
The most well known search techniques are perhaps the PageRank and HITS algorithms. In this paper we argue that these algorithms miss an important dimension, the temporal dimensio...
Philip S. Yu, Xin Li, Bing Liu