5 search results - page 1 / 1 » A note on the hardness of Skolem-type sequences |
DAM
2010
13 years 4 months ago
2010
The purpose of this note is to give upper bounds (assuming P different from NP) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the ex...
WIA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
ACCV
2006
Springer
13 years 10 months ago
2006
Springer
We describe a method for computing a dense estimate of motion and disparity, given a stereo video sequence containing moving non-rigid objects. In contrast to previous approaches, ...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
BMCBI
2006
13 years 4 months ago
2006
Background: In the genomic age, gene trees may contain large amounts of data making them hard to read and understand. Therefore, an automated simplification is important. Results:...