101 search results - page 5 / 21 » Subrecursive functions on partial sequences |
65
Voted
DLT
2008
14 years 11 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional R √ 1 + K2 ds, depending both on le...
ICWS
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper proposes a model-based technique for lowering the entrance barrier for service providers to register services with a marketplace broker, such that the service is rapidl...
MOR
2008
14 years 9 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
MST
2010
14 years 8 months ago
2010
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...