997 search results - page 6 / 200 » Completely Lazy Learning |
161
Voted
ML
2000
ACM
15 years 3 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
125
click to vote
ESOP
2012
Springer
13 years 11 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
129
click to vote
CAV
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
116
Voted
FLAIRS
1998
15 years 4 months ago
1998
Weintroduce a significant improvementfor a relatively newmachine learning methodcalled Transformation-Based Learning. By applying a MonteCarlo strategy to randomly sample from the...
72
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
