2125 search results - page 214 / 425 » On Graph Complexity |
139
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
139
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
140
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Whilst tools assist the various tasks required to develop a multi-agent system (MAS), yet there still remains a gap between the generation of MAS models and program code. AUML dev...
167
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
132
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...