|
Volumn , Issue , 2005, Pages 230-237
|
Exploiting the tradeoff between precision and cpu-time to speed up nearest neighbor search
|
Author keywords
Large databases; Nearest neighbor; Similarity measure; Timbre
|
Indexed keywords
ALGORITHMIC VARIANTS;
CONVERGENCE SPEED;
FILTERING ALGORITHM;
GAUSSIAN MIXTURE MODEL;
INTRINSIC PROPERTY;
KULLBACK-LEIBLER DISTANCE;
LARGE DATABASE;
METRIC SPACES;
MONTE CARLO;
MONTE-CARLO APPROXIMATIONS;
NEAREST NEIGHBOR SEARCH;
NEAREST NEIGHBORS;
SIMILARITY MEASURE;
SPEED UP;
SUCCESSIVE APPROXIMATIONS;
TIMBRE;
TIMBRE SIMILARITIES;
APPROXIMATION THEORY;
COMMUNICATION CHANNELS (INFORMATION THEORY);
INFORMATION RETRIEVAL;
MONTE CARLO METHODS;
APPROXIMATION ALGORITHMS;
|
EID: 34047196692
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (12)
|
References (15)
|