110 search results - page 11 / 22 » Interleaved Depth-First Search |
124
Voted
KDD
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
126
Voted
SIGIR
2009
ACM
15 years 10 months ago
2009
ACM
A growing trend in commercial search engines is the display of specialized content such as news, products, etc. interleaved with web search results. Ideally, this content should b...
116
Voted
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We have recently proposed DSLX, a motion planner that significantly reduces the computational time for solving challenging kinodynamic problems by interleaving continu...
123
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
142
Voted
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...