Sciweavers

2612 search results - page 264 / 523
» Assemblies as Graph Processes
Sort
View
197
Voted
FASE
2005
Springer
16 years 5 days ago
Termination Criteria for Model Transformation
Model Transformation has become central to most software engineering activities. It refers to the process of modifying a (usually graphical) model for the purpose of analysis (by i...
Hartmut Ehrig, Karsten Ehrig, Juan de Lara, Gabrie...
HPCC
2005
Springer
16 years 4 days ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
ICTCS
2005
Springer
16 years 4 days ago
Weighted Coloring: Further Complexity and Approximability Results
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
Bruno Escoffier, Jérôme Monnot, Vange...
ECBS
2003
IEEE
145views Hardware» more  ECBS 2003»
15 years 12 months ago
Model Checking and Evidence Exploration
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
15 years 10 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002