Sciweavers

32 search results - page 2 / 7
» Improved Nearly-MDS Expander Codes
Sort
View
AAAI
2011
12 years 9 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
STACS
2005
Springer
14 years 3 months ago
Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes
We revisit the construction of high noise, almost optimal rate list decodable code of Guruswami [1]. Guruswami showed that if one can explicitly construct optimal extractors then o...
Eran Rom, Amnon Ta-Shma
MICRO
1997
IEEE
87views Hardware» more  MICRO 1997»
14 years 1 months ago
Improving Code Density Using Compression Techniques
We propose a method for compressing programs in embedded processors where instruction memory size dominates cost. A post-compilation analyzer examines a program and replaces commo...
Charles Lefurgy, Peter L. Bird, I-Cheng K. Chen, T...
ICMCS
2006
IEEE
104views Multimedia» more  ICMCS 2006»
14 years 3 months ago
A Study on Spatial Scalable Coding using Vector Representation
The major advantage of vector representation of an image is that the image quality is maintained for arbitrary scaling. In recent years, a demand for scalable image coding has bee...
Yuki Yamamoto, Kei Kawamura, Hiroshi Watanabe
ASPLOS
2011
ACM
13 years 1 months ago
Improving the performance of trace-based systems by false loop filtering
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...
Hiroshige Hayashizaki, Peng Wu, Hiroshi Inoue, Mau...