Sciweavers

1825 search results - page 130 / 365
» Local Dimensionality Reduction
Sort
View
CEC
2009
IEEE
15 years 8 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 3 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 10 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
ICETET
2009
IEEE
15 years 28 days ago
Face Description with Local Invariant Features: Application to Face Recognition
A completely automatic face recognition system is presented. The method works on color face images and localizes the face region from them initially. It then determines and select...
Sanjay A. Pardeshi, S. N. Talbar
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 8 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...