110 search results - page 3 / 22 » Domains of Higher-Dimensional Automata |
VC
2010
13 years 4 months ago
2010
In this paper we present a new algorithm to transform an RGB color image to a grayscale image. We propose using non-linear dimension reduction techniques to map higher dimensional ...
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
CVPR
2007
IEEE
13 years 7 months ago
2007
IEEE
Traditional linear Fukunaga-Koontz Transform (FKT) [1] is a powerful discriminative subspaces building approach. Previous work has successfully extended FKT to be able to deal wit...
FCT
2007
Springer
14 years 3 days ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
10
Voted
CONCUR
2003
Springer
13 years 11 months ago
2003
Springer
We establish that on the domain of probabilistic automata, the trace distribution precongruence coincides with the simulation preorder.