Sciweavers

6251 search results - page 179 / 1251
» Randomness, Computability, and Density
Sort
View
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
15 years 9 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
ICC
2009
IEEE
198views Communications» more  ICC 2009»
15 years 10 months ago
On the Capacity Region of the Gaussian Multiple Access Channel with Noisy Feedback
—We provide a new outer bound on the capacity region of the two-user Gaussian multiple access channel (MAC) with AWGN-corrupted feedback. Our outer bound is based on the idea of ...
Ravi Tandon, Sennur Ulukus
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 10 months ago
On the Tails of the Distribution of the Sum of Lognormals
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
Sebastien S. Szyszkowicz, Halim Yanikomeroglu
INFOCOM
2007
IEEE
15 years 10 months ago
Paradox of Shortest Path Routing for Large Multi-Hop Wireless Networks
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
Sungoh Kwon, Ness B. Shroff
CRYPTO
2003
Springer
124views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
Primality Proving via One Round in ECPP and One Iteration in AKS
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
Qi Cheng