Sciweavers

4850 search results - page 919 / 970
» Approximate Data Structures with Applications
Sort
View
ICS
2003
Tsinghua U.
15 years 3 months ago
Inferential queueing and speculative push for reducing critical communication latencies
Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of Inferentially...
Ravi Rajwar, Alain Kägi, James R. Goodman
DCC
2000
IEEE
15 years 2 months ago
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
Nedeljko Varnica, Michael Fleming, Michelle Effros
VISUALIZATION
1999
IEEE
15 years 2 months ago
Tetrahedral Mesh Compression with the Cut-Border Machine
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine t...
Stefan Gumhold, Stefan Guthe, Wolfgang Straß...
SC
1992
ACM
15 years 1 months ago
Willow: A Scalable Shared Memory Multiprocessor
We are currently developing Willow, a shared-memory multiprocessor whose design provides system capacity and performance capable of supporting over a thousand commercial microproc...
John K. Bennett, Sandhya Dwarkadas, Jay A. Greenwo...
MOBISYS
2010
ACM
15 years 4 days ago
Growing an organic indoor location system
Most current methods for 802.11-based indoor localization depend on surveys conducted by experts or skilled technicians. Some recent systems have incorporated surveying by users. ...
Jun-geun Park, Ben Charrow, Dorothy Curtis, Jonath...