Sciweavers

350 search results - page 6 / 70
» Lower and upper bounds on obtaining history independence
Sort
View
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling Laws for Wireless Networks with Fading Channels
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. ...
RECOMB
2005
Springer
14 years 7 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 2 months ago
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
Mehdi Molkaraie, Payam Pakzad
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 7 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
MOC
2002
75views more  MOC 2002»
13 years 6 months ago
Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the per
This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudora...
Frank Emmerich