Sciweavers

1277 search results - page 97 / 256
» The Google Similarity Distance
Sort
View
CASES
2005
ACM
15 years 8 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
BIOINFORMATICS
2007
137views more  BIOINFORMATICS 2007»
15 years 6 months ago
Annotation-based distance measures for patient subgroup discovery in clinical microarray studies
: Background Clustering algorithms are widely used in the analysis of microarray data. In clinical studies, they are often applied to find groups of co-regulated genes. Clustering...
Claudio Lottaz, Joern Toedling, Rainer Spang
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 8 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
CORR
1998
Springer
110views Education» more  CORR 1998»
15 years 6 months ago
Ultrametric Distance in Syntax
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
Mark D. Roberts
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
15 years 12 months ago
Alternate Representation of Distance Matrices for Characterization of Protein Structure
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
Keith Marsolo, Srinivasan Parthasarathy