Sciweavers

2517 search results - page 211 / 504
» Specifying Weak Sets
Sort
View
ICML
2005
IEEE
16 years 7 months ago
A smoothed boosting algorithm using probabilistic output codes
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...
Rong Jin, Jian Zhang
ICML
2004
IEEE
16 years 7 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
WWW
2007
ACM
16 years 7 months ago
Organizing and searching the world wide web of facts -- step two: harnessing the wisdom of the crowds
As part of a large effort to acquire large repositories of facts from unstructured text on the Web, a seed-based framework for textual information extraction allows for weakly sup...
Marius Pasca
CADE
2009
Springer
16 years 7 months ago
Real World Verification
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
André Platzer, Jan-David Quesel, Philipp R&...
PODC
2009
ACM
16 years 7 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...