Sciweavers

501 search results - page 36 / 101
» Communication Lower Bounds Using Dual Polynomials
Sort
View
SIGPRO
2010
99views more  SIGPRO 2010»
13 years 7 months ago
Oversampled phase tracking in digital communications with large excess bandwidth
This paper deals with the on-line carrier phase estimation in a digital receiver. We consider a Brownian phase evolution in a Data Aided scenario. The proposed study uses an overs...
Jordi Vilà-Valls, Jean-Marc Brossier, Laure...
PODC
2011
ACM
12 years 11 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
ITA
2000
13 years 8 months ago
Construction of very hard functions for multiparty communication complexity
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
Ján Manuch
SSS
2009
Springer
133views Control Systems» more  SSS 2009»
14 years 1 months ago
A Metastability-Free Multi-synchronous Communication Scheme for SoCs
We propose a communication scheme for GALS systems with independent but approximately synchronized clock sources, which guarantees high-speed metastability-free communication betwe...
Thomas Polzer, Thomas Handl, Andreas Steininger
ICCV
2009
IEEE
15 years 1 months ago
Joint optimization of segmentation and appearance models
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother