Sciweavers

139 search results - page 14 / 28
» Model Checking Graph Transformations: A Comparison of Two Ap...
Sort
View
VLSID
2001
IEEE
129views VLSI» more  VLSID 2001»
14 years 9 months ago
Design Of Provably Correct Storage Arrays
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
Rajiv V. Joshi, Wei Hwang, Andreas Kuehlmann
ECSQARU
2009
Springer
14 years 20 days ago
A Generalization of the Pignistic Transform for Partial Bet
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
Thomas Burger, Alice Caplier
ISIM
2007
13 years 10 months ago
Formal Computation Independent Model of the Problem Domain within the MDA
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
Janis Osis, Erika Asnina, Andrejs Grave
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 9 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
PAMI
1998
107views more  PAMI 1998»
13 years 8 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock