Results 21 to 30 of about 1,282,075 (289)
Talking with pictures: Exploring the possibilities of iconic communication [PDF]
As multimedia computing becomes the order of the day, so there is a greater need to understand and to come to terms with the problems of visual presentation.
Beardon, Colin +3 more
core +2 more sources
Probabilistic automata for computing with words
35 pages; 3 ...
Cao, Yongzhi +2 more
openaire +2 more sources
An Interval Type-2 Fuzzy Ontological Similarity Measure
Human language is naturally fuzzy by nature, with words meaning different things to different people, depending on the context. Fuzzy words, are words with a subjective meaning, typically used in everyday human natural language dialogue; they are often ...
Naeemeh Adel +3 more
doaj +1 more source
Unambiguous Separators for Tropical Tree Automata [PDF]
In this paper we show that given a max-plus automaton (over trees, and with real weights) computing a function f and a min-plus automaton (similar) computing a function g such that f ?
Colcombet, Thomas, Lombardy, Sylvain
core +3 more sources
Collaborative decision making (CDM) with linguistic computational techniques has recently achieved significant advancements. Due to the widespread use of sophisticated linguistic constructions, such as generalized comparative linguistic expressions ...
Zhen-Song Chen +5 more
doaj +1 more source
Computing with molecules is at the center of complex natural phenomena, where the information contained in ordered sequences of molecules is used to implement functionalities of synthesized materials or to interpret the environment, as in Biology.
Marta Dueñas-Díez +3 more
doaj +1 more source
DAFSA: a Python library for Deterministic Acyclic Finite State Automata [Software]
This work describes dafsa, a Python library for computing graphs from lists of strings for identifying, visualizing, and inspecting patterns of substrings.
Tresoldi, T.
core +1 more source
Asymptotic properties of free monoid morphisms [PDF]
Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$ is the image of
Charlier, Emilie +2 more
core +1 more source
A (naïve) glance at Soft Computing [PDF]
This paper contains some naïve reflections on the currently large field of Soft Computing. After some general considerations, and of recalling some successful well known examples, it is posed the relationship between Soft Computing and Machine ...
Enric Trillas +2 more
doaj +1 more source
Service-based systems (SBSs) need to be reconfigured when there is evidence that the selected Web services configurations no further satisfy the specifications models and, thus the decision-related models will need to be updated accordingly.
Romina Torres +3 more
doaj +1 more source

