1054 search results - page 42 / 211 » Fast Approximated SIFT |
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
112
click to vote
INFOCOM
2009
IEEE
15 years 4 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...
ACCV
2007
Springer
15 years 4 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...
CCCG
2010
14 years 11 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...
TWC
2010
14 years 4 months ago
2010
Abstract--In this paper we consider the capacity of the cognitive radio (CR) channel in a fading environment under a "low interference regime". This capacity depends crit...