Sciweavers

16404 search results - page 2809 / 3281
» A set coverage problem
Sort
View
CORR
1999
Springer
67views Education» more  CORR 1999»
15 years 6 months ago
Robust Combining of Disparate Classifiers through Order Statistics
: Integrating the outputs of multiple classifiers via combiners or meta-learners has led to substantial improvements in several difficult pattern recognition problems. In this arti...
Kagan Tumer, Joydeep Ghosh
DATAMINE
1999
108views more  DATAMINE 1999»
15 years 6 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
LOGCOM
2002
142views more  LOGCOM 2002»
15 years 6 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke
MAM
2002
151views more  MAM 2002»
15 years 6 months ago
A performance evaluation of cache injection in bus-based shared memory multiprocessors
Bus-based shared memory multiprocessors with private caches and snooping write-invalidate cache coherence protocols are dominant form of small- to medium-scale parallel machines t...
Aleksandar Milenkovic, Veljko M. Milutinovic
MCS
2002
Springer
15 years 6 months ago
A Discussion on the Classifier Projection Space for Classifier Combining
In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variabilit...
Elzbieta Pekalska, Robert P. W. Duin, Marina Skuri...
« Prev « First page 2809 / 3281 Last » Next »