Sciweavers

1652 search results - page 158 / 331
» Matching Vector Codes
Sort
View
TIT
2008
164views more  TIT 2008»
14 years 11 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
JMLR
2010
119views more  JMLR 2010»
14 years 6 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
ICMCS
2007
IEEE
127views Multimedia» more  ICMCS 2007»
15 years 6 months ago
Reducing Motion Estimation Complexity in MPEG-2 TO H.264 Transcoding
The two key problems in video transcoding are complexity reduction and quality management. The complexity of H.264 encoding makes complexity reduction even more important. A good ...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
VECPAR
2004
Springer
15 years 5 months ago
Automatically Tuned FFTs for BlueGene/L's Double FPU
Abstract. IBM is currently developing the new line of BlueGene/L supercomputers. The top-of-the-line installation is planned to be a 65,536 processors system featuring a peak perfo...
Franz Franchetti, Stefan Kral, Juergen Lorenz, Mar...
ICML
2010
IEEE
15 years 27 days ago
COFFIN: A Computational Framework for Linear SVMs
In a variety of applications, kernel machines such as Support Vector Machines (SVMs) have been used with great success often delivering stateof-the-art results. Using the kernel t...
Sören Sonnenburg, Vojtech Franc