3220 search results - page 187 / 644 » Constrained Graph Processes |
167
click to vote
ICIAR
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
182
click to vote
IWPC
2000
IEEE
15 years 10 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
171
click to vote
ACSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
We map intrusion events to known exploits in the network attack graph, and correlate the events through the corresponding attack graph distances. From this, we construct attack sc...
142
click to vote
UAI
2004
15 years 7 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
166
click to vote
JMIV
2008
15 years 6 months ago
2008
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...