Sciweavers

73 search results - page 6 / 15
» English-Hindi Transliteration using Multiple Similarity Metr...
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
12 years 1 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
EDBT
1998
ACM
131views Database» more  EDBT 1998»
14 years 3 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ECML
2006
Springer
14 years 2 months ago
Subspace Metric Ensembles for Semi-supervised Clustering of High Dimensional Data
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
Bojun Yan, Carlotta Domeniconi
KDD
2012
ACM
188views Data Mining» more  KDD 2012»
12 years 1 months ago
A probabilistic model for multimodal hash function learning
In recent years, both hashing-based similarity search and multimodal similarity search have aroused much research interest in the data mining and other communities. While hashing-...
Yi Zhen, Dit-Yan Yeung
ICSE
2008
IEEE-ACM
14 years 11 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto