Sciweavers

129 search results - page 15 / 26
» Lower Bounds of Computational Power of a Synaptic Calculus
Sort
View
ICNP
2006
IEEE
14 years 1 months ago
O-MAC: A Receiver Centric Power Management Protocol
— Energy efficiency is widely understood to be one of the dominant considerations for Wireless Sensor Networks. Based on historical data and technology trends, the receiver ener...
Hui Cao, Ken Parker, Anish Arora
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
14 years 25 days ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
FOCS
2003
IEEE
14 years 23 days ago
The Cost of Cache-Oblivious Searching
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
Michael A. Bender, Gerth Stølting Brodal, R...
SPAA
1995
ACM
13 years 11 months ago
Parallel Sorting with Limited Bandwidth
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
Micah Adler, John W. Byers, Richard M. Karp
ICALP
2004
Springer
14 years 25 days ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...