Sciweavers

1855 search results - page 92 / 371
» A coding theorem for distributed computation
Sort
View
HPCA
2001
IEEE
16 years 29 days ago
Automatically Mapping Code on an Intelligent Memory Architecture
This paper presents an algorithm to automatically map code on a generic intelligent memory system that consists of a host processor and a simpler memory processor. To achieve high...
Jaejin Lee, Yan Solihin, Josep Torrellas
110
Voted
CLUSTER
2008
IEEE
15 years 7 months ago
A comparison of search heuristics for empirical code optimization
—This paper describes the application of various search techniques to the problem of automatic empirical code optimization. The search process is a critical aspect of auto-tuning...
Keith Seymour, Haihang You, Jack Dongarra
96
Voted
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Syndrome-Based Light-Weight Video Coding for Mobile Wireless Application
In conventional video coding, the complexity of an encoder is generally much higher than that of a decoder because of operations such as motion estimation consume significant com...
Min Wu, Guogang Hua, Chang Chen
123
Voted
SIGCOMM
2012
ACM
13 years 3 months ago
RaptorStream: boosting mobile peer-to-peer streaming with raptor codes
As mobile devices and cellular networks become ubiquitous, first apps for popular P2P video streaming networks emerge. We have observed that when these applications operate in ce...
Philipp M. Eittenberger
124
Voted
FOCS
2000
IEEE
15 years 5 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan