Sciweavers

244 search results - page 17 / 49
» A Linear Search Strategy using Bounds
Sort
View
MM
2003
ACM
113views Multimedia» more  MM 2003»
14 years 1 months ago
The combination limit in multimedia retrieval
Combining search results from multimedia sources is crucial for dealing with heterogeneous multimedia data, particularly in multimedia retrieval where a final ranked list of item...
Rong Yan, Alexander G. Hauptmann
SDM
2012
SIAM
293views Data Mining» more  SDM 2012»
11 years 11 months ago
RP-growth: Top-k Mining of Relevant Patterns with Minimum Support Raising
One practical inconvenience in frequent pattern mining is that it often yields a flood of common or uninformative patterns, and thus we should carefully adjust the minimum suppor...
Yoshitaka Kameya, Taisuke Sato
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 8 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
CVPR
2007
IEEE
14 years 10 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
COR
2006
98views more  COR 2006»
13 years 8 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve