Sciweavers

1855 search results - page 6 / 371
» A coding theorem for distributed computation
Sort
View
TIT
2010
81views Education» more  TIT 2010»
13 years 5 months ago
Generalizing capacity: new definitions and capacity theorems for composite channels
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...
Michelle Effros, Andrea J. Goldsmith, Yifan Liang
HPDC
1993
IEEE
14 years 3 months ago
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
Paul D. Coddington
FOCI
2007
IEEE
14 years 5 months ago
Waiting time analysis of foreign currency exchange rates: Beyond the renewal-reward theorem
— We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for ...
Naoya Sazuka, Jun-ichi Inoue
PPOPP
2005
ACM
14 years 4 months ago
Static analysis of atomicity for programs with non-blocking synchronization
In concurrent programming, non-blocking synchronization is very efficient but difficult to design correctly. This paper presents a static analysis to show that code blocks are ato...
Liqiang Wang, Scott D. Stoller
FOCS
2008
IEEE
13 years 12 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy