654 search results - page 24 / 131 » Matrix Graph Grammars |
COMBINATORICS
2006
13 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...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...