1021 search results - page 42 / 205 » Fast Approximate PCPs |
142
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
103
Voted
ACCV
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
110
Voted
CCCG
2010
15 years 3 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
SIAMMAX
2010
14 years 8 months ago
2010
Ruhe's rational Krylov method is a popular tool for approximating eigenvalues of a given matrix, though its convergence behavior is far from being fully understood. Under fair...
115
Voted
KDD
2002
ACM
16 years 2 months ago
2002
ACM
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...