Sciweavers

209 search results - page 6 / 42
» Local Search for Statistical Counting
Sort
View
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 8 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 1 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
CVPR
2009
IEEE
15 years 4 months ago
Fast concurrent object localization and recognition
Object localization and classification are important problems in computer vision. However, in many applications, exhaustive search over all class labels and image locations is co...
Tom Yeh, John J. Lee, Trevor Darrell
SIGIR
2010
ACM
14 years 23 days ago
Learning more powerful test statistics for click-based retrieval evaluation
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
Yisong Yue, Yue Gao, Olivier Chapelle, Ya Zhang, T...
CIKM
2008
Springer
13 years 11 months ago
Pairwise statistical significance of local sequence alignment using multiple parameter sets
Background: Accurate estimation of statistical significance of a pairwise alignment is an important problem in sequence comparison. Recently, a comparative study of pairwise stati...
Ankit Agrawal, Xiaoqiu Huang