Sciweavers

1297 search results - page 13 / 260
» Dynamic Object Process Graphs
Sort
View
ICPR
2002
IEEE
14 years 12 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
14 years 7 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
NIPS
2007
14 years 9 days ago
Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
In this paper we formulate a novel AND/OR graph representation capable of describing the different configurations of deformable articulated objects such as horses. The representa...
Yuanhao Chen, Long Zhu, Chenxi Lin, Alan L. Yuille...
WEBI
2004
Springer
14 years 4 months ago
Using Semantic Graphs in Clustering Process : Enhance Information Level
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Jean-Sébastien Brunner, Isabelle Berrien
CPC
2007
125views more  CPC 2007»
13 years 11 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera