Sciweavers

111 search results - page 22 / 23
» From irreducible representations to locally decodable codes
Sort
View
SIAMIS
2010
114views more  SIAMIS 2010»
13 years 3 months ago
Improved Total Variation-Type Regularization Using Higher Order Edge Detectors
We present a novel deconvolution approach to accurately restore piecewise smooth signals from blurred data. The first stage uses Higher Order Total Variation restorations to obtai...
Wolfgang Stefan, Rosemary A. Renaut, Anne Gelb
IJHPCA
2010
84views more  IJHPCA 2010»
13 years 3 months ago
Operation Stacking for Ensemble Computations With Variable Convergence
Sparse matrix operations achieve only small fractions of peak CPU speeds because of the use of specialized, indexbased matrix representations, which degrade cache utilization by i...
Mehmet Belgin, Godmar Back, Calvin J. Ribbens
AINA
2005
IEEE
13 years 11 months ago
A Practical Modelling Notation for Secure Distributed Computation
Mobile code computation has lead to a new paradigm of distributed computation. A mobile process can move from site to site and interact with the resources as a local process. To p...
Yih-Jiun Lee, Peter Henderson
POPL
2008
ACM
14 years 5 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
IJHPCA
2007
114views more  IJHPCA 2007»
13 years 5 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima