2084 search results - page 244 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
113
click to vote
EDBT
2004
ACM
15 years 10 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...
STACS
2010
Springer
15 years 5 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 ...
CVPR
2001
IEEE
16 years 1 days 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...
100
click to vote
WCNC
2008
IEEE
15 years 4 months 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...
DAC
2008
ACM
15 years 11 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...