814 search results - page 48 / 163 » Graphical Models for Graph Matching |
ICML
2004
IEEE
14 years 11 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
CCR
2010
13 years 7 months ago
2010
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
SIGGRAPH
1995
ACM
14 years 1 months ago
1995
ACM
We describe an extension of B-splines to surfacesof arbitrary topology, including arbitrary boundaries. The technique inherits many of the properties of B-splines: local control, ...
GG
2008
Springer
13 years 11 months ago
2008
Springer
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...
UAI
1996
13 years 11 months ago
1996
We derive qualitative relationships about the informationalrelevance of variables in graphical decision models based on a consideration of the topology of the models. Speci cally,...