Sciweavers

2924 search results - page 231 / 585
» Lower Bounds in Distributed Computing
Sort
View
DCOSS
2010
Springer
15 years 7 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
120
Voted
EUROCRYPT
2007
Springer
15 years 10 months ago
Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin
ECOOP
1993
Springer
15 years 8 months ago
A Timed Calculus for Distributed Objects with Clocks
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...
Ichiro Satoh, Mario Tokoro
CPHYSICS
2006
128views more  CPHYSICS 2006»
15 years 3 months ago
MOMDIS: a Glauber model computer code for knockout reactions
A computer program is described to calculate momentum distributions in stripping and diffraction dissociation reactions. A Glauber model is used with the scattering wavefunctions ...
C. A. Bertulani, A. Gade
TWC
2008
113views more  TWC 2008»
15 years 3 months ago
OFDM Carrier Synchronization Based on Time-Domain Channel Estimates
Carrier frequency synchronization is critical to the quality of signal reception in OFDM systems. This paper presents an approximate maximum-likelihood (ML) carrier frequency offse...
Hao Zhou, Amaresh V. Malipatil, Yih-Fang Huang