3652 search results - page 502 / 731 » A study of query length |
203
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Abstract. The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight. Energy-conscious design is important at all levels of syste...
187
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
192
click to vote
WSDM
2012
ACM
2012
ACM
Large-scale analysis of individual and task differences in search result page examination strategies
14 years 2 months ago
Understanding the impact of individual and task differences on search result page examination strategies is important in developing improved search engines. Characterizing these e...
205
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
192
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...