Sciweavers

5699 search results - page 60 / 1140
» Alternating model trees
Sort
View
UAI
1993
15 years 11 days ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
IJFCS
2006
108views more  IJFCS 2006»
14 years 11 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
75
Voted
LREC
2008
125views Education» more  LREC 2008»
15 years 14 days ago
I saw TREE trees in the park: How to Correct Real-Word Spelling Mistakes
This paper presents a context sensitive spell checking system that uses mixed trigram models, and introduces a new empirically grounded method for building confusion sets. The pro...
Davide Fossati, Barbara Di Eugenio
ECML
2007
Springer
15 years 3 months ago
Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble
Abstract. Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the deci...
Anneleen Van Assche, Hendrik Blockeel
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 10 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye