Sciweavers

5640 search results - page 1060 / 1128
» Parallelizing the Data Cube
Sort
View
GLOBECOM
2006
IEEE
14 years 2 months ago
Cooperative Relay Networks Using Fountain Codes
We investigate a cooperative communications scheme with N parallel relays, where both the transmissions from the source to the relays and from the relays to the destination use fo...
Andreas F. Molisch, Neelesh B. Mehta, Jonathan S. ...
CLUSTER
2005
IEEE
14 years 2 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
OOPSLA
2005
Springer
14 years 2 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
APGV
2004
ACM
164views Visualization» more  APGV 2004»
14 years 2 months ago
Subband encoding of high dynamic range imagery
The transition from traditional 24-bit RGB to high dynamic range (HDR) images is hindered by excessively large file formats with no backwards compatibility. In this paper, we prop...
Greg Ward, Maryann Simmons
ASPLOS
2004
ACM
14 years 2 months ago
Coherence decoupling: making use of incoherence
This paper explores a new technique called coherence decoupling, which breaks a traditional cache coherence protocol into two protocols: a Speculative Cache Lookup (SCL) protocol ...
Jaehyuk Huh, Jichuan Chang, Doug Burger, Gurindar ...
« Prev « First page 1060 / 1128 Last » Next »