6045 search results - page 95 / 1209 » Computable Linearizations of Well-partial-orderings |
171
click to vote
COCO
2011
Springer
14 years 4 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...
159
click to vote
SCW
2012
IEEE
13 years 12 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...
114
click to vote
PR
2007
15 years 3 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...
140
click to vote
ICIAP
2007
ACM
16 years 4 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...
129
click to vote
ICASSP
2009
IEEE
15 years 11 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 ...