2040 search results - page 250 / 408 » On the Complexity of Error Explanation |
173
click to vote
APCCAS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we develop a robust bit-plane watermarking technique based on zerotree coding. A robust watermark is an imperceptible but indelible code that can be used for owners...
189
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
149
click to vote
SI3D
1999
ACM
15 years 10 months ago
1999
ACM
We present a system for rendering very complex 3D models at interactive rates. We select a subset of the model as preferred viewpoints and partition the space into virtual cells. ...
143
Voted
ICCAD
1998
IEEE
15 years 10 months ago
1998
IEEE
Due to the exponential growth of both design complexity and the number of gates per pin, functional debugging has emerged as a critical step in the development of a system-on-chip...
158
Voted
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...