Sciweavers

85 search results - page 9 / 17
» Randomness on Computable Probability Spaces - A Dynamical Po...
Sort
View
ICPP
2006
IEEE
14 years 1 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
WCNC
2010
IEEE
13 years 11 months ago
Optimal Tradeoff Between Transmission Rate and Packet Duration in Wireless Ad Hoc Networks
—This paper considers the tradeoff between bursty and continuous transmissions in wireless ad hoc networks. In our network model, packets belonging to specific transmitters arri...
Jon E. Corneliussen, Mariam Kaynia, Geir E. &Oslas...
TMC
2010
143views more  TMC 2010»
13 years 5 months ago
Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing
—This paper deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than...
Paul J. Darby III, Nian-Feng Tzeng
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 7 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...