Sciweavers

580 search results - page 93 / 116
» On the Theory of Stochastic Processors
Sort
View
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
15 years 2 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
77
Voted
VISUALIZATION
2002
IEEE
15 years 2 months ago
Interactive Rendering of Large Volume Data Sets
We present a new algorithm for rendering very large volume data sets at interactive framerates on standard PC hardware. The algorithm accepts scalar data sampled on a regular grid...
Stefan Guthe, Michael Wand, Julius Gonser, Wolfgan...
LANC
2009
ACM
178views Education» more  LANC 2009»
15 years 2 months ago
A connection level model for IEEE 802.11 cells
We study a wireless network under the 802.11 random access protocol, supporting multiple physical layer rates. Based on models for the effective packet rates achieved at the MAC ...
Andrés Ferragut, Fernando Paganini
ASPLOS
1992
ACM
15 years 1 months ago
Access Normalization: Loop Restructuring for NUMA Compilers
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
Wei Li, Keshav Pingali
PODC
1991
ACM
15 years 1 months ago
Resource Bounds for Self Stabilizing Message Driven Protocols
Abstract. Self-stabilizing message driven protocols are defined and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is de...
Shlomi Dolev, Amos Israeli, Shlomo Moran