Sciweavers

2032 search results - page 229 / 407
» Relevance for browsing, relevance for searching
Sort
View
98
Voted
JAIR
2000
123views more  JAIR 2000»
15 years 1 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
SIGIR
2012
ACM
13 years 4 months ago
An exploration of ranking heuristics in mobile local search
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
Yuanhua Lv, Dimitrios Lymberopoulos, Qiang Wu
WWW
2009
ACM
16 years 2 months ago
Click chain model in web search
Given a terabyte click log, can we build an efficient and effective click model? It is commonly believed that web search click logs are a gold mine for search business, because th...
Anitha Kannan, Chao Liu 0001, Christos Faloutsos, ...
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
15 years 7 months ago
Statistical similarity search applied to content-based video copy detection
—Content-based copy detection (CBCD) is one of the emerging multimedia applications for which there is a need of a concerted effort from the database community and the computer ...
Alexis Joly, Olivier Buisson, Carl Frélicot
121
Voted
BMCBI
2008
137views more  BMCBI 2008»
15 years 1 months ago
Evading the annotation bottleneck: using sequence similarity to search non-sequence gene data
Background: Non-sequence gene data (images, literature, etc.) can be found in many different public databases. Access to these data is mostly by text based methods using gene name...
Michael J. Gilchrist, Mikkel B. Christensen, Richa...