Sciweavers

617 search results - page 62 / 124
» Similarity Beyond Distance Measurement
Sort
View
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 10 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
14 years 9 months ago
Augmenting the generalized hough transform to enable the mining of petroglyphs
Rock art is an archaeological term for human-made markings on stone. It is believed that there are millions of petroglyphs in North America alone, and the study of this valued cul...
Eamonn J. Keogh, Qiang Zhu 0002, Sang-Hee Lee, Xia...
CP
2009
Springer
14 years 9 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
BMCBI
2006
137views more  BMCBI 2006»
13 years 9 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
ICML
2004
IEEE
14 years 9 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall