Sciweavers

20 search results - page 2 / 4
» Search via quantum walk
Sort
View
SIGIR
2008
ACM
13 years 5 months ago
Talking the talk vs. walking the walk: salience of information needs in querying vs. browsing
Traditional information retrieval models assume that users express their information needs via text queries (i.e., their "talk"). In this poster, we consider Web browsin...
Mikhail Bilenko, Ryen W. White, Matthew Richardson...
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
13 years 9 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang
SIGIR
2009
ACM
13 years 12 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
AUSAI
2007
Springer
13 years 9 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
JSAT
2008
113views more  JSAT 2008»
13 years 5 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...