Sciweavers

2237 search results - page 273 / 448
» On the Security of Random Sources
Sort
View
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
15 years 11 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan
ECAL
2001
Springer
15 years 10 months ago
Symbiotic Composition and Evolvability
Several of the Major Transitions in natural evolution, such as the symbiogenic origin of eukaryotes from prokaryotes, share the feature that existing entities became the components...
Richard A. Watson, Jordan B. Pollack
LSSC
2001
Springer
15 years 10 months ago
A Quasi-Monte Carlo Method for Integration with Improved Convergence
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
Aneta Karaivanova, Ivan Dimov, Sofiya Ivanovska
184
Voted
INFOCOM
2000
IEEE
15 years 10 months ago
The Chaotic Nature of TCP Congestion Control
— In this paper we demonstrate how TCP congestion control can show chaotic behavior. We demonstrate the major features of chaotic systems in TCP/IP networks with examples. These ...
Andras Veres, Miklós Boda
RANDOM
1997
Springer
15 years 10 months ago
A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
Oded Goldreich, Shmuel Safra