19320 search results - page 3824 / 3864 » On the complexity of computing determinants |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
110
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
112
click to vote
CPHYSICS
2010
14 years 9 months ago
2010
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...