2084 search results - page 180 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
158
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
—We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless l...
160
click to vote
ICDM
2003
IEEE
2003
IEEE
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
15 years 10 months ago
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
160
click to vote
DATE
2009
IEEE
2009
IEEE
Analyzing the impact of process variations on parametric measurements: Novel models and applications
15 years 12 months ago
Abstract—In this paper we propose a novel statistical framework to model the impact of process variations on semiconductor circuits through the use of process sensitive test stru...
119
click to vote
FCT
2003
Springer
15 years 10 months ago
2003
Springer
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
125
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...