4198 search results - page 275 / 840 » In search of lost time |
199
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
221
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
216
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
172
Voted
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
198
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any central...