Sciweavers

4192 search results - page 469 / 839
» Efficient testing of groups
Sort
View
CP
2009
Springer
16 years 6 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 6 months ago
Outlier detection by sampling with accuracy guarantees
An effective approach to detect anomalous points in a data set is distance-based outlier detection. This paper describes a simple sampling algorithm to efficiently detect distance...
Mingxi Wu, Chris Jermaine
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 6 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
16 years 6 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
16 years 6 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic