333 search results - page 35 / 67 » Speeding up moving-target search |
CP
2006
Springer
15 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
We investigate the use of hierarchical Gaussian shortlists to speed up Gaussian likelihood computation. This approach is a combination of hierarchical Gaussian selection and stand...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper presents a variation of Apriori algorithm that includes the role of domain expert to guide and speed up the overall knowledge discovery task. Usually, the user is inter...
104
Voted
ACCV
2010
Springer
14 years 5 months ago
2010
Springer
Accurate localization of the salient object from an image is a difficult problem when the saliency map is noisy and incomplete. A fast approach to detect salient objects from image...
95
Voted
ECCV
2008
Springer
16 years 3 days ago
2008
Springer
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...