419 search results - page 21 / 84 » Using Matrix Decompositions in Formal Concept Analysis |
ACSD
2007
IEEE
14 years 2 months ago
2007
IEEE
Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic...
ICRA
2000
IEEE
14 years 2 days ago
2000
IEEE
Determination of the magnitudes and directions of the constraints of a mechanical system can be achieved by finding the basis of the system’s characteristic compliance matrix. ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
FMCAD
2000
Springer
13 years 11 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...