Sciweavers

3758 search results - page 435 / 752
» A Complete Subsumption Algorithm
Sort
View
AAAI
1998
15 years 8 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
UAI
1998
15 years 8 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
AAAI
1996
15 years 8 months ago
Planning to Gather Information
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Chung T. Kwok, Daniel S. Weld
ISMB
1996
15 years 8 months ago
Gene Prediction by Pattern Recognition and Homology Search
This paper presents an algorithm for combining pattern recognition-based exon prediction and database homologysearch in gene model construction. Thegoal is to use homologousgeneso...
Ying Xu, Edward C. Uberbacher
SODA
1993
ACM
118views Algorithms» more  SODA 1993»
15 years 8 months ago
Scapegoat Trees
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
Igal Galperin, Ronald L. Rivest