Sciweavers

2924 search results - page 68 / 585
» Lower Bounds in Distributed Computing
Sort
View
LATIN
1998
Springer
14 years 1 months ago
The CREW PRAM Complexity of Modular Inversion
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
Joachim von zur Gathen, Igor Shparlinski
ORL
2008
88views more  ORL 2008»
13 years 8 months ago
Approximating integrals of multivariate exponentials: A moment approach
We propose a method to calculate lower and upper bounds of some exponential multivariate integrals using moment relaxations and show that they asymptotically converge to the value...
Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasser...
MONET
2008
135views more  MONET 2008»
13 years 8 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 9 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. ...
ECCV
2002
Springer
14 years 10 months ago
Parameter Estimates for a Pencil of Lines: Bounds and Estimators
Estimating the parameters of a pencil of lines is addressed. A statistical model for the measurements is developed, from which the Cramer Rao lower bound is determined. An estimato...
Gavriel Speyer, Michael Werman