1190 search results - page 100 / 238 » On the Structure of Syntenic Distance |
107
click to vote
KDD
2012
ACM
13 years 17 days ago
2012
ACM
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...
75
Voted
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
BMCBI
2007
14 years 10 months ago
2007
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...