1092 search results - page 139 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
212
click to vote
IBERAMIA
2010
Springer
15 years 4 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
206
click to vote
CORR
2011
Springer
15 years 23 days ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
161
click to vote
ICIP
1997
IEEE
16 years 7 months ago
1997
IEEE
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
144
click to vote
ICASSP
2008
IEEE
16 years 22 days ago
2008
IEEE
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
155
click to vote
ICDM
2008
IEEE
16 years 22 days ago
2008
IEEE
Social interactions that occur regularly typically correspond to significant yet often infrequent and hard to detect interaction patterns. To identify such regular behavior, we p...