Sciweavers

435 search results - page 34 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
15 years 11 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
15 years 4 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
74
Voted
GLVLSI
2003
IEEE
129views VLSI» more  GLVLSI 2003»
15 years 3 months ago
A system-level methodology for fast multi-objective design space exploration
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized systems. Since the design space is multi-objective, our aim ...
Gianluca Palermo, Cristina Silvano, S. Valsecchi, ...
CVPR
2011
IEEE
14 years 6 months ago
Inference for Order Reduction in Markov Random Fields
This paper presents an algorithm for order reduction of factors in High-Order Markov Random Fields (HOMRFs). Standard techniques for transforming arbitrary high-order factors in...
Andrew C. Gallagher, Dhruv Batra, Devi Parikh
CORR
2010
Springer
145views Education» more  CORR 2010»
14 years 9 months ago
Feature Level Clustering of Large Biometric Database
This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local de...
Hunny Mehrotra, Dakshina Ranjan Kisku, V. Bhawani ...