6598 search results - page 49 / 1320 » Graph Theory with Applications |
114
click to vote
CAIP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
139
click to vote
EUROMICRO
1996
IEEE
15 years 8 months ago
1996
IEEE
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
113
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
146
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
179
click to vote
JCSC
1998
15 years 3 months ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...