Sciweavers

2703 search results - page 324 / 541
» Optimizing memory transactions
Sort
View
IANDC
2011
84views more  IANDC 2011»
14 years 11 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
TIT
2010
103views Education» more  TIT 2010»
14 years 10 months ago
Codes in permutations and error correction for rank modulation
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
Alexander Barg, Arya Mazumdar
ICASSP
2011
IEEE
14 years 7 months ago
Low-complexity predictive lossy compression of hyperspectral and ultraspectral images
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
Andrea Abrardo, Mauro Barni, Enrico Magli
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 6 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
CVPR
2010
IEEE
15 years 11 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr