92 search results - page 14 / 19 » Making the Breakout Algorithm Complete Using Systematic Sear... |
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
CAIP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Many classes of images exhibit sparse structuring of statistical dependency. Each variable has strong statistical dependency with a small number of other variables and ne...
DAGSTUHL
2006
14 years 10 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
69
Voted
KDD
2002
ACM
15 years 9 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 ...
101
click to vote
EUROSYS
2011
ACM
14 years 28 days ago
2011
ACM
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...