Sciweavers

1041 search results - page 57 / 209
» Randomizing Reductions of Search Problems
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Efficient indexing for large scale visual search
With the popularity of "bag of visual terms" representations of images, many text indexing techniques have been applied in large-scale image retrieval systems. However, ...
Xiao Zhang, Zhiwei Li, Lei Zhang, Wei-Ying Ma, Heu...
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
14 years 8 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
13 years 9 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli
ICALP
2005
Springer
14 years 1 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
TOC
2008
94views more  TOC 2008»
13 years 8 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai