1605 search results - page 223 / 321 » On Partitional Labelings of Graphs |
141
click to vote
PAMI
2006
15 years 2 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
126
click to vote
RSA
2010
15 years 1 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
154
click to vote
SAC
2011
ACM
14 years 5 months ago
2011
ACM
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
103
Voted
VLDB
1999
ACM
15 years 7 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
127
click to vote
APN
2006
Springer
15 years 6 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...