1054 search results - page 75 / 211 » Fast Approximated SIFT |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
TOG
2010
14 years 4 months ago
2010
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...
111
click to vote
SDM
2012
SIAM
13 years 7 days ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
103
click to vote
AAAI
2012
13 years 7 days ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...