Sciweavers

1016 search results - page 88 / 204
» Generalized distances between rankings
Sort
View
ICPP
1995
IEEE
15 years 4 months ago
Unicasting in Faulty Hypercubes Using Safety Levels
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
Jie Wu
JEI
2000
134views more  JEI 2000»
15 years 1 months ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent
ICML
2007
IEEE
16 years 2 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
DCC
2001
IEEE
16 years 24 days ago
Trellis Structure and Higher Weights of Extremal Self-Dual Codes
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
Houshou Chen, John T. Coffey
SPIRE
2005
Springer
15 years 6 months ago
Composite Pattern Discovery for PCR Application
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...
Stanislav Angelov, Shunsuke Inenaga