Sciweavers

5473 search results - page 31 / 1095
» On the graph isomorphism problem
Sort
View
LICS
2010
IEEE
14 years 9 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
CVPR
2000
IEEE
15 years 4 months ago
Learning Patterns from Images by Combining Soft Decisions and Hard Decisions
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
Pengyu Hong, Thomas S. Huang, Roy Wang
ICPR
2006
IEEE
16 years 27 days ago
Object Localization Using Input/Output Recursive Neural Networks
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
Lorenzo Sarti, Marco Maggini, Monica Bianchini
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
14 years 10 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
PVLDB
2010
122views more  PVLDB 2010»
14 years 10 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han