5100 search results - page 376 / 1020 » The Linear Complexity of a Graph |
217
click to vote
TIC
2000
Springer
15 years 10 months ago
2000
Springer
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
230
click to vote
IPCV
2008
15 years 8 months ago
2008
Linear Discriminant Analysis(LDA) is well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data,...
199
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
140
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
174
click to vote
APPML
2005
15 years 6 months ago
2005
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...