Sciweavers

4591 search results - page 179 / 919
» The Global Computer
Sort
View
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 7 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
SLIP
2009
ACM
15 years 10 months ago
Honeycomb-structured computational interconnects and their scalable extension to spherical domains
The present paper is part of a larger effort to redesign, from the ground up, the best possible interconnect topologies for switchless multiprocessor computer systems. We focus he...
Joseph B. Cessna, Thomas R. Bewley
AICCSA
2006
IEEE
168views Hardware» more  AICCSA 2006»
15 years 10 months ago
Power Efficient Algorithms for Computing Fast Fourier Transform over Wireless Sensor Networks
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
Turkmen Canli, Ajay K. Gupta, Ashfaq A. Khokhar
124
Voted
ICCS
2004
Springer
15 years 9 months ago
Active and Logistical Networking for Grid Computing: The E-toile Architecture
While active networks provide new solutions for the deployment of dynamic services in the network, exposing network processing resources, logistical networking focuses on exposing...
Alessandro Bassi, Micah Beck, Fabien Chanussot, Je...
120
Voted
TOG
2002
129views more  TOG 2002»
15 years 3 months ago
Homomorphic factorization of BRDF-based lighting computation
Several techniques have been developed to approximate Bidirectional Reflectance Distribution Functions (BRDF) with acceptable quality and performance for realtime applications. Th...
Lutz Latta, Andreas Kolb