Sciweavers

1283 search results - page 8 / 257
» Learning Voting Trees
Sort
View
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 2 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
ICDAR
1999
IEEE
13 years 11 months ago
MergeLayouts: Overcoming Faulty Segmentations by a Comprehensive Voting of Commercial OCR Devices
In this paper, we will present a comprehensive voting approach, taking entire layouts obtained from commercial OCR devices as input. Such a layout comprises segments of three kind...
Stefan Klink, Thorsten Jäger
ECML
2007
Springer
13 years 11 months ago
On Pairwise Naive Bayes Classifiers
Class binarizations are effective methods for improving weak learners by decomposing multi-class problems into several two-class problems. This paper analyzes how these methods can...
Jan-Nikolas Sulzmann, Johannes Fürnkranz, Eyk...
ALT
2007
Springer
14 years 4 months ago
Learning Rational Stochastic Tree Languages
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
François Denis, Amaury Habrard
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
14 years 1 months ago
UCSpv: principled voting in UCS rule populations
Credit assignment is a fundamental issue for the Learning Classifier Systems literature. We engage in a detailed investigation of credit assignment in one recent system called UC...
Gavin Brown, Tim Kovacs, James A. R. Marshall