10 search results - page 2 / 2 » Antichains in partially ordered sets of singular cofinality |
ITA
2008
13 years 5 months ago
2008
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
SCALESPACE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. There is an increasing demand to develop image processing tools for the filtering and analysis of matrix-valued data, so-called matrix fields. In the case of scalar-val...
JSYML
2006
13 years 5 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
JSYML
2007
13 years 5 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
SDM
2003
SIAM
13 years 6 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...