Sciweavers

218 search results - page 16 / 44
» Composite Binary Losses
Sort
View
CSL
2010
Springer
13 years 8 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
ICDAR
2003
IEEE
14 years 21 days ago
An Improved Parallel Thinning Algorithm
This paper describes an improved thinning algorithm for binary images. We improve thinning algorithm from the fundamental properties such as connectivity, onepixel width, robust t...
Lei Huang, Genxun Wan, Changping Liu
COLT
2006
Springer
13 years 11 months ago
Continuous Experts and the Binning Algorithm
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
Jacob Abernethy, John Langford, Manfred K. Warmuth
ECML
2006
Springer
13 years 11 months ago
Case-Based Label Ranking
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...
Klaus Brinker, Eyke Hüllermeier
IACR
2011
152views more  IACR 2011»
12 years 7 months ago
Rational distance-bounding protocols over noisy channels
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
Long H. Nguyen