5100 search results - page 126 / 1020 » The Linear Complexity of a Graph |
117
Voted
CAS
2008
15 years 3 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
127
click to vote
ACL
2010
15 years 1 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
149
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
125
click to vote
EUROCOLT
1995
Springer
15 years 6 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
116
click to vote
DLT
2006
15 years 4 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...