1952 search results - page 158 / 391 » Complete partitions of graphs |
114
click to vote
JASIS
2007
15 years 4 months ago
2007
cience Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The re...
131
Voted
ICDCS
2007
IEEE
15 years 11 months ago
2007
IEEE
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
253
Voted
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
129
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
130
click to vote
JLP
2006
15 years 4 months ago
2006
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...