Sciweavers

2434 search results - page 312 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
116
Voted
AAAI
1998
15 years 5 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
112
Voted
IJCAI
1997
15 years 5 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...
120
Voted
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 3 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
160
Voted
GRID
2006
Springer
15 years 3 months ago
Snapshot Processing in Streaming Environments
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...
Daniel M. Zimmerman, K. Mani Chandy
137
Voted
JACM
2007
115views more  JACM 2007»
15 years 3 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...