Heuristics for the Whitehead minimization problem.
Hierarchical residue number systems with small moduli and simple converters
In this paper, a new class of Hierarchical Residue Number Systems (HRNSs) is proposed, where the numbers are represented as a set of residues modulo factors of 2k ± 1 and modulo 2k . The converters between the proposed HRNS and the positional binary number system can be built as 2-level structures using efficient circuits designed for the RNS (2k-1, 2k, 2k+1). This approach allows using many small moduli in arithmetic channels without large conversion overhead. The advantages resulting from the...
Hierarchical text categorization using fuzzy relational thesaurus
Text categorization is the classification to assign a text document to an appropriate category in a predefined set of categories. We present a new approach for the text categorization by means of Fuzzy Relational Thesaurus (FRT). FRT is a multilevel category system that stores and maintains adaptive local dictionary for each category. The goal of our approach is twofold; to develop a reliable text categorization method on a certain subject domain, and to expand the initial FRT by automatically added...
Hierarchies and reducibilities on regular languages related to modulo counting
We discuss some known and introduce some new hierarchies and reducibilities on regular languages, with the emphasis on the quantifier-alternation and difference hierarchies of the quasi-aperiodic languages. The non-collapse of these hierarchies and decidability of some levels are established. Complete sets in the levels of the hierarchies under the polylogtime and some quantifier-free reducibilities are found. Some facts about the corresponding degree structures are established. As an application,...
Hierarchies and reducibilities on regular languages related to modulo counting
We discuss some known and introduce some new hierarchies and reducibilities on regular languages, with the emphasis on the quantifier-alternation and difference hierarchies of the quasi-aperiodic languages. The non-collapse of these hierarchies and decidability of some levels are established. Complete sets in the levels of the hierarchies under the polylogtime and some quantifier-free reducibilities are found. Some facts about the corresponding degree structures are established. As an application, we...
Hiérarchies de concaténation
Hierarchies of aperiodic languages
Hierarchies of weakly monotone restarting automata
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
Hierarchies of weakly monotone restarting automata
It is known that the weakly monotone restarting automata accept exactly the growing context-sensitive languages. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
Hierarchy of reversal bounded one-way multicounter machines
High order edge elements on simplicial meshes
Low order edge elements are widely used for electromagnetic field problems. Higher order edge approximations are receiving increasing interest but their definition become rather complex. In this paper we propose a simple definition for Whitney edge elements of polynomial degree higher than one. We give a geometrical localization of all degrees of freedom over particular edges and provide a basis for these elements on simplicial meshes. As for Whitney edge elements of degree one, the basis is...
Higher-dimensional categories with finite derivation type.
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
Highly robust training of regularizedradial basis function networks
Radial basis function (RBF) networks represent established tools for nonlinear regression modeling with numerous applications in various fields. Because their standard training is vulnerable with respect to the presence of outliers in the data, several robust methods for RBF network training have been proposed recently. This paper is interested in robust regularized RBF networks. A robust inter-quantile version of RBF networks based on trimmed least squares is proposed here. Then, a systematic comparison...
Highly Undecidable Problems For Infinite Computations
We show that many classical decision problems about 1-counter ω-languages, context free ω-languages, or infinitary rational relations, are Π½ -complete, hence located at the second level of the analytical hierarchy, and “highly undecidable”. In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and the unambiguity problem are all Π½ -complete for context-free ω-languages or for infinitary rational...
Histoire et préhistoire de l'analyse des données
Histoire et préhistoire de l'analyse des données
Histoire et préhistoire de l'analyse des données
Histoire et préhistoire de l'analyse des données
Histoires de fichiers