Sciweavers

147 search results - page 14 / 30
» Nearest neighbor search through function minimization
Sort
View
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
15 years 12 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
15 years 5 months ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal
SSD
1999
Springer
197views Database» more  SSD 1999»
15 years 4 months ago
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
Classification is one of the basic tasks of data mining in modern database applications including molecular biology, astronomy, mechanical engineering, medical imaging or meteorolo...
Mihael Ankerst, Gabi Kastenmüller, Hans-Peter...
TMC
2011
127views more  TMC 2011»
14 years 6 months ago
Discriminant Minimization Search for Large-Scale RF-Based Localization Systems
— In large-scale fingerprinting localization systems, fine-grained location estimation and quick location determination are conflicting concerns. To achieve finer-grained loc...
Sheng-Po Kuo, Yu-Chee Tseng
ICML
2005
IEEE
16 years 15 days ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho