Sciweavers

2040 search results - page 99 / 408
» On the Complexity of Error Explanation
Sort
View
FMCAD
2009
Springer
14 years 3 months ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
ML
2006
ACM
110views Machine Learning» more  ML 2006»
13 years 9 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez
ICIP
2001
IEEE
14 years 10 months ago
Algorithmic modifications to SPIHT
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
Ulug Bayazit, William A. Pearlman
ICML
2007
IEEE
14 years 10 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
ICCD
1992
IEEE
83views Hardware» more  ICCD 1992»
14 years 1 months ago
Logical Verification of the NVAX CPU Chip Design
ct Digital's NVAX high-performance microprocessor has a complex logical design. A rigorous simulation-based verification effort was undertaken to ensure that there were no log...
Walker Anderson