5100 search results - page 311 / 1020 » The Linear Complexity of a Graph |
152
click to vote
LACL
2005
Springer
15 years 10 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
127
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: As an alternative to the frequently used "reference design" for two-channel microarrays, other designs have been proposed. These designs have been shown to b...
169
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
129
Voted
IJAC
2002
15 years 4 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
170
click to vote
GG
2008
Springer
15 years 5 months ago
2008
Springer
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...