Sciweavers

6299 search results - page 114 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
ICC
2007
IEEE
16 years 1 months ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
PROCEDIA
2010
281views more  PROCEDIA 2010»
15 years 5 months ago
Introductory computational science using MATLAB and image processing
We describe a new course designed to introduce engineering students to computational thinking. One of the most significant challenges in teaching an introductory-level applied co...
D. Brian Larkins, William Harvey
DIS
2007
Springer
16 years 1 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
IPPS
2007
IEEE
16 years 1 months ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
ECCV
2002
Springer
16 years 8 months ago
Robust Computer Vision through Kernel Density Estimation
Abstract. Two new techniques based on nonparametric estimation of probability densities are introduced which improve on the performance of equivalent robust methods currently emplo...
Haifeng Chen, Peter Meer