62 search results - page 3 / 13 » Complexity measures of sign matrices |
100
click to vote
ICPR
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
COMBINATORICS
2006
14 years 9 months ago
2006
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
CISS
2011
IEEE
14 years 1 months ago
2011
IEEE
—Signals of interests can often be thought to come from a low dimensional signal model. The exploitation of this fact has led to many recent interesting advances in signal proces...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
88
Voted
VLSISP
2010
14 years 4 months ago
2010
A common approach to extract phonemes of sign language is to use an unsupervised clustering algorithm to group the sign segments. However, simple clustering algorithms based on dis...