Sciweavers

139 search results - page 15 / 28
» Introduction to Testing Graph Properties
Sort
View
JUCS
2007
95views more  JUCS 2007»
13 years 8 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 10 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
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...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
DILS
2005
Springer
13 years 10 months ago
Assigning Unique Keys to Chemical Compounds for Data Integration: Some Interesting Counter Examples
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be use...
Greeshma Neglur, Robert L. Grossman, Bing Liu
ENTCS
2006
172views more  ENTCS 2006»
13 years 8 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 8 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...