Sciweavers

655 search results - page 18 / 131
» Performance Optimization and Evaluation for Linear Codes
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
TPDS
2002
75views more  TPDS 2002»
13 years 7 months ago
An Experimental Evaluation of I/O Optimizations on Different Applications
Many large scale applications have significant I/O requirements as well as computational and memory requirements. Unfortunately, the limited number of I/O nodes provided in a typic...
Meenakshi A. Kandaswamy, Mahmut T. Kandemir, Alok ...
SIAMSC
2008
193views more  SIAMSC 2008»
13 years 7 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
Sadegh Jokar, Marc E. Pfetsch
DCC
2008
IEEE
14 years 7 months ago
Dimension Reduction and Expansion: Distributed Source Coding in a Noisy Environment
We studied the problem of distributed coding and transmission of intercorrelated sources with memory. Different from the conventional distributed source coding structure which rel...
Anna N. Kim, Fredrik Hekland
MICRO
2003
IEEE
135views Hardware» more  MICRO 2003»
14 years 1 months ago
Generational Cache Management of Code Traces in Dynamic Optimization Systems
A dynamic optimizer is a runtime software system that groups a program’s instruction sequences into traces, optimizes those traces, stores the optimized traces in a softwarebase...
Kim M. Hazelwood, Michael D. Smith