Sciweavers

230 search results - page 8 / 46
» The Inclusion Problem for Regular Expressions
Sort
View
ICIP
2008
IEEE
14 years 3 months ago
An iterative algorithm for linear inverse problems with compound regularizers
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
José M. Bioucas-Dias, Mário A. T. Fi...
EMMCVPR
2011
Springer
12 years 8 months ago
Curvature Regularity for Multi-label Problems - Standard and Customized Linear Programming
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
Thomas Schoenemann, Yubin Kuang, Fredrik Kahl
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 6 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 1 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
14 years 28 days ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund