Sciweavers

1085 search results - page 8 / 217
» Hug over a distance
Sort
View
RECOMB
2008
Springer
14 years 9 months ago
Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
Miklós Csürös
ICC
2009
IEEE
146views Communications» more  ICC 2009»
13 years 6 months ago
On Construction of Moderate-Length LDPC Codes over Correlated Erasure Channels
The design of moderate-length erasure correcting low-density parity-check (LDPC) codes over correlated erasure channels is considered. Although the asymptotic LDPC code design rema...
Gianluigi Liva, Balázs Matuz, Zoltán...
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 4 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
TCSV
2010
13 years 3 months ago
Face and Human Gait Recognition Using Image-to-Class Distance
We propose a new distance measure for face recognition and human gait recognition. Each probe image (a face image or an average human silhouette image) is represented as a set of ...
Yi Huang, Dong Xu, Tat-Jen Cham
TKDE
2011
332views more  TKDE 2011»
13 years 3 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose