2084 search results - page 369 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
102
click to vote
INFORMATICALT
2008
14 years 9 months ago
2008
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
ISCA
2007
IEEE
15 years 4 months ago
2007
IEEE
Software cache-based side channel attacks are a serious new class of threats for computers. Unlike physical side channel attacks that mostly target embedded cryptographic devices,...
SIGMETRICS
2010
ACM
15 years 2 months ago
2010
ACM
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
103
click to vote
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...