Sciweavers

343 search results - page 9 / 69
» On Making Directed Graphs Transitive
Sort
View
KR
2004
Springer
15 years 5 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
VLDB
2005
ACM
82views Database» more  VLDB 2005»
15 years 5 months ago
Stack-based Algorithms for Pattern Matching on DAGs
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Li Chen, Amarnath Gupta, M. Erdem Kurul
BIRTHDAY
2005
Springer
15 years 5 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
ACMICEC
2006
ACM
191views ECommerce» more  ACMICEC 2006»
15 years 5 months ago
An ontology of trust: formal semantics and transitivity
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
Jingwei Huang, Mark S. Fox
ICB
2007
Springer
163views Biometrics» more  ICB 2007»
15 years 5 months ago
Palmprint Recognition Based on Directional Features and Graph Matching
Palmprint recognition, as a reliable personal identity check method, has been receiving increasing attention during recent years. According to previous work, local texture analysis...
Yufei Han, Tieniu Tan, Zhenan Sun