Sciweavers

2992 search results - page 307 / 599
» Semantic Distance Measures
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
DAM
2002
67views more  DAM 2002»
15 years 6 months ago
Optimal arrangement of data in a tree directory
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
Malwina J. Luczak, Steven D. Noble
DATAMINE
2002
114views more  DATAMINE 2002»
15 years 6 months ago
Techniques of Cluster Algorithms in Data Mining
An overview of cluster analysis techniques from a data mining point of view is given. This is done by a strict separation of the questions of various similarity and distance measur...
Johannes Grabmeier, Andreas Rudolph
BMVC
2010
15 years 4 months ago
Pairwise Macropixel Comparison Can Work at Least as Well as Advanced Holistic Algorithms for Face Recognition
It is well known that, due to illumination effects and the registration/alignment problem, it does not make sense to compare the "values" of two single-pixels for face r...
Liang Chen
TCBB
2011
15 years 1 months ago
Comparison of Galled Trees
Galled trees, directed acyclic graphs that model evolutionary histories with isolated hybridization events, have become very popular due to both their biological significance and ...
Gabriel Cardona, Mercè Llabrés, Fran...