Clustering categorical sequences is currently a difficult problem due to the lack of an efficient representation model for sequences. Unlike the existing models, which mainly focus on the fixed-length tuples representation, in this paper, a new representation model on the variablelength tuples is proposed. The variable-length tuples are obtained using a pruning method applied to delete the redu...

Mobile wireless video delivery is still challenging due to its limited bandwidth and dynamic channel status. In this paper, a novel approach named Dubbing Video Slides (DVS) is proposed to cope with the bandwidth limitation problem. Based on a statistical video content importance analysis, DVS method can dynamically select and transmit representative video frames which are relatively more impor...

We propose a new descriptive complexity notion of uniformity for branching programs solving problems defined on structured data. We observe that FO[=]-uniform (n-way) branching programs are unable to solve the tree evaluation problem studied by Cook, McKenzie, Wehr, Braverman and Santhanam [8] because such programs possess a variant of their thriftiness property. Similarly, FO[=]-uniform (n-way...

It is argued that the distinction between the normative and the descriptive interpretation of norm sentences can be regarded as a distinction between two kinds of utterances. A norm or a directive has as its content a normative proposition. A normative (performative) utterance of a normative proposition in appropriate circumstances makes the proposition true, and an assertive (descriptive) utte...

Our aim is to see which practices of Greek geometry can be expressed in various logics. Thus we refine Detlefsen’s notion of descriptive complexity by providing a scheme of increasing more descriptive formalizations of geometry Following Hilbert we argue that defining a field structure on a line in ‘Euclidean geometry’ provides a foundation for both geometry and algebra. In particular we prove ...

The descriptional complexity of semi-conditional grammars is studied. It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2, 1) with no more than seven conditional productions and eight nonterminals.

In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can involve knot diagrams with arbitrarily many crossings then Gauss words will be considered as strings over an infinite (unbounded) alphabet. For establishing t...