6045 search results - page 95 / 1209 » Computable Linearizations of Well-partial-orderings |
COCO
2011
Springer
12 years 7 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
SCW
2012
IEEE
12 years 3 months ago
2012
IEEE
We consider pure exchange economies with finitely many private goods involving the choice of a public project. We discuss core-equivalence results in the general framework of non...
PR
2007
13 years 7 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
ICIAP
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we propose a computational scheme named an interval-based linear hybrid dynamical system (ILHDS) to represent complex dynamic events based on temporal intervals, ea...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...