Sciweavers

3415 search results - page 120 / 683
» Lower Bounds for Kernelizations
Sort
View
LATIN
1998
Springer
15 years 8 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
ICONIP
2004
15 years 5 months ago
An Auxiliary Variational Method
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...
Felix V. Agakov, David Barber
ISITA
2010
15 years 2 months ago
An achievable rate of large block-fading MIMO systems with no CSI via successive decoding
Abstract--A Rayleigh block-fading multiple-input multipleoutput (MIMO) channel with channel state information (CSI) available neither to the transmitter nor to the receiver is cons...
Keigo Takeuchi, Ralf R. Müller, Mikko Vehkape...
FS
2006
102views more  FS 2006»
15 years 4 months ago
Bounds for Functions of Dependent Risks
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
Paul Embrechts, Giovanni Puccetti
COCOON
2004
Springer
15 years 9 months ago
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudenc...