Sciweavers

2040 search results - page 14 / 408
» On the Complexity of Error Explanation
Sort
View
DCC
1993
IEEE
13 years 12 months ago
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
DAGSTUHL
2006
13 years 9 months ago
Complexity Monotone in Conditions and Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
JSCIC
2006
60views more  JSCIC 2006»
13 years 7 months ago
Bounded Error Schemes for the Wave Equation on Complex Domains
Saul Abarbanel, Adi Ditkowski, Amir Yefet
ACE
2003
89views Education» more  ACE 2003»
13 years 9 months ago
The Neglected Battle Fields of Syntax Errors
Syntax error correction is an essential part of the debugging process. Yet there has been little research investigating how programmers approach syntax error correction and how to...
Sarah K. Kummerfeld, Judy Kay
JSS
2002
128views more  JSS 2002»
13 years 7 months ago
The cost of errors in software development: evidence from industry
The search for and correction of errors in software are often time consuming and expensive components of the total cost of software development. The current research investigates ...
J. Christopher Westland