Sciweavers

88 search results - page 10 / 18
» On the Complexity of Matroid Isomorphism Problem
Sort
View
AMW
2011
13 years 5 days 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
ICDAR
2009
IEEE
13 years 6 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
ALGORITHMICA
2008
115views more  ALGORITHMICA 2008»
13 years 8 months ago
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
Falk Hüffner, Sebastian Wernicke, Thomas Zich...
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 8 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara