2084 search results - page 244 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
200
Voted
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
159
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
165
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
183
click to vote
WCNC
2008
IEEE
16 years 16 days ago
2008
IEEE
—In this paper, a wireless cognitive radio sensor network is considered, where each sensor node is equipped with cognitive radio and the network is a multi-carrier system operati...
147
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Since process and environmental variations can no longer be ignored in high-performance microprocessor designs, it is necessary to develop techniques for computing the sensitiviti...