Sciweavers

2880 search results - page 265 / 576
» Approximate Range Searching
Sort
View
125
Voted
TODAES
2008
160views more  TODAES 2008»
15 years 3 months ago
A new efficient retiming algorithm derived by formal manipulation
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...
Hai Zhou
TMM
2002
115views more  TMM 2002»
15 years 3 months ago
Principles of schema design for multimedia databases
This paper presents the rudiments of a theory of schema design for databases containing high dimensional features of the type used for describing multimedia data. We introduce a mo...
Simone Santini, Amarnath Gupta
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 10 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
ICCV
2009
IEEE
1611views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Packing bag-of-features
One of the main limitations of image search based on bag-of-features is the memory usage per image. Only a few million images can be handled on a single machine in rea- sonable ...
Herve Jegou, Matthijs Douze, Cordelia Schmid
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
16 years 5 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain