6045 search results - page 267 / 1209 » Computable Linearizations of Well-partial-orderings |
199
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...
190
click to vote
SPIN
2007
Springer
16 years 1 months ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
179
click to vote
LSSC
2005
Springer
16 years 23 days ago
2005
Springer
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
213
click to vote
PRDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
176
click to vote
ACCV
2007
Springer
16 years 1 months ago
2007
Springer
This paper introduces a novel convex kernel based method for color constancy computation with explicit illuminant parameter estimation. A simple linear render model is adopted and ...