4009 search results - page 214 / 802 » Clustering on Complex Graphs |
158
click to vote
ICFCA
2004
Springer
15 years 9 months ago
2004
Springer
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
133
click to vote
SEMWEB
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
156
click to vote
PODS
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
119
click to vote
ENTCS
2006
15 years 4 months ago
2006
We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers an...
130
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...