6045 search results - page 227 / 1209 » Computable Linearizations of Well-partial-orderings |
WG
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
A new image feature called Harris feature vector is defined in this paper, which effectively describes the image gradient distribution. By computing the mean and the standard devi...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
K-Nearest Neighbors relies on the definition of a global metric. In contrast, Discriminant Adaptive Nearest Neighbor (DANN) computes a different metric at each query point based o...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...