1830 search results - page 184 / 366 » Workshop on Graph Computation Models |
176
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
169
click to vote
CIBCB
2006
IEEE
16 years 3 days ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
196
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
159
click to vote
FM
1999
Springer
15 years 10 months ago
1999
Springer
We present novel techniques for efficient controller synthesis for untimed and timed systems with respect to invariance and reachability properties. In the untimed case, we give al...
175
click to vote
EUROISI
2008
15 years 7 months ago
2008
Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...