Sciweavers

882 search results - page 3 / 177
» On the Hardness of Graph Isomorphism
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 5 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
CVPR
2000
IEEE
13 years 10 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
AMW
2011
12 years 9 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 5 months ago
On the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
Shmuel Friedland
MST
2011
231views Hardware» more  MST 2011»
12 years 8 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma