Sciweavers

7796 search results - page 380 / 1560
» On Generalized Schur Numbers
Sort
View
DCC
2005
IEEE
16 years 7 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
EUROGRAPHICS
2010
Eurographics
16 years 4 months ago
Uncertain 2D Vector Field Topology
We introduce an approach to visualize stationary 2D vector fields with global uncertainty obtained by considering the transport of local uncertainty in the flow. For this, we ex...
Mathias Otto, Tobias Germer, Hans-Christian Hege, ...
ALT
2008
Springer
16 years 4 months ago
Entropy Regularized LPBoost
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
ALT
2000
Springer
16 years 4 months ago
Learning Recursive Concepts with Anomalies
This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios in which the learner is successful if its final hypothesis describ...
Gunter Grieser, Steffen Lange, Thomas Zeugmann
ICCAD
2007
IEEE
107views Hardware» more  ICCAD 2007»
16 years 4 months ago
Computation of minimal counterexamples by using black box techniques and symbolic methods
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
Tobias Nopper, Christoph Scholl, Bernd Becker