Sciweavers

412 search results - page 49 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
JPDC
2008
135views more  JPDC 2008»
14 years 11 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward
ICSE
2008
IEEE-ACM
15 years 12 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto
AND
2009
14 years 9 months ago
Tools for monitoring, visualizing, and refining collections of noisy documents
Developing better systems for document image analysis requires understanding errors, their sources, and their effects. The interactions between various processing steps are comple...
Daniel P. Lopresti, George Nagy
TIT
1998
81views more  TIT 1998»
14 years 11 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
ECCV
2006
Springer
16 years 1 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother