Results 271 to 280 of about 108,184 (297)
Some of the next articles are maybe not open access.
Computing with Words — A Framework for Human-Computer Interaction
2019In this paper we explore the possibility of using computation with words (CWW) systems and CWW-based human-computer interface (HCI) and interaction to enable efficient computation and HCI. The application selected to demonstrate the problems and potential solutions is in the context of autonomous driving.
Dan E. Tamir +4 more
openaire +1 more source
A reconstruction decoder for computing with words
Information Sciences, 2014The Word decoder is a very important approach for decoding in the Perceptual Computer. It maps the computing with words (CWWs) engine output, which is a fuzzy set, into a word in a codebook so that it can be understood. However, the Word decoder suffers from significant information loss, i.e., the fuzzy set model of the mapped word may be quite ...
openaire +1 more source
The complexity of computing maximal word functions
1991Maximal word functions occur in data retrival applications and have connections with ranking problems i.e. with problems related to data compression. Compute the maximal word function of a string x with respect to a language L ⊑ Σ* consists in determining the lexicographically greatest word belonging to L, which is smaller than or equal to x.
D. BRUSCHI, G. PIGHIZZINI
openaire +2 more sources
Hierarchies of Computable groups and the word problem
Journal of Symbolic Logic, 1966The word problem for groups was first formulated by M. Dehn [1], who gave a solution for the fundamental groups of a closed orientable surface of genus g ≧ 2. In the following years solutions were given, for example, for groups with one defining relator [2], free groups, free products of groups with a solvable word problem and, in certain cases, free ...
openaire +2 more sources
Finite Sets of Words and Computing
2005We discuss about two recent undecidability results in formal language theory. The corresponding problems are very simply formulated questions on finite sets of words. In particular, these results underline how finite sets of words can be used to perform powerful computations.
openaire +1 more source
Computing with 10,000-bit words
2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2014Today's computers compute with numbers and memory pointers that hardly ever exceed 64 bits. With nan-otechnology we will soon be able to build computers with 10,000-bit words. How would such a computer work and what would it be good for? The paper describes a 10,000bit architecture that resembles von Neumann's.
openaire +1 more source
Computational Complexity of Word Counting
2001Evaluation of the frequency of occurrences of a given set of patterns in a DNA sequence has numerous applications and has been extensively studied recently. We discuss the computational complexity for explicit formulae derived by several authors. We introduce a correlation automaton, that minimizes this complexity.
openaire +1 more source
Latin and Greek in Computing: Ancient Words in a New World
Computer, 2022Fabrizio Lombardi, Elena Merino-Gómez
exaly