919 search results - page 43 / 184 » Efficient computation of view subsets |
PVLDB
2010
13 years 3 months ago
2010
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
TSP
2010
13 years 3 months ago
2010
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
CRYPTO
2008
Springer
13 years 10 months ago
2008
Springer
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
embedded in a sliding-window scheme. Such exhaustive
search involves massive computation. Efficient Subwindow
Search (ESS) [11] avoids this by means of branch
and bound. However...
ICCV
2005
IEEE
2005
IEEE
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
14 years 10 months ago
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...