Results 201 to 210 of about 4,040 (235)

Large Language Models for Supporting Clear Writing and Detecting Spin in Randomized Controlled Trials in Oncology: Comparative Analysis of GPT Models and Prompts. [PDF]

JMIR Cancer
Koechli C, Dennstädt F, Schröder C, Aebersold DM, Förster R, Zwahlen DR, Windisch P.   +6 more
europepmc   +1 more source

Evaluation of Generative Artificial Intelligence Safeguards Against the Creation of Images and Videos Harmful to Public Health. [PDF]

Public Health Rep
Chu B, Modi ND, Menz BD, Cornelisse E, Bacchi S, Bulamu N, Ullah S, McKinnon RA, Gradon K, Rowland A, Sorich MJ, Hopkins AM.   +11 more
europepmc   +1 more source

Reducing Local Alphabet Size in Recognizable Picture Languages [PDF]

Lecture Notes in Computer Science, 2021
A recognizable picture language is defined as the projection of a local picture language defined by a set of two-by-two tiles, i.e. by a strictly-locally-testable (SLT) language of order 2. The family of recognizable picture languages is also defined, using larger k by k tiles, \(k>2\), by the projection of the corresponding SLT language.
Pierluigi San Pietro, Antonio Restivo, Stefano Crespi Reghizzi   +2 more
exaly   +3 more sources

Classification of String Languages via Tiling Recognizable Picture Languages [PDF]

Lecture Notes in Computer Science, 2011
We introduce the definition of string language S recognized via picture language P and prove that there is a one-to-one correspondence between a linear bounded automaton (LBA) for S and a tiling system for P. As consequence tiling systems become an alternative description for LBA that possibly exploits some geometric properties of lines and shapes ...
Dora Giammarresi, Maria Serafina Madonia, Anselmo Marcella   +2 more
exaly   +3 more sources

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases [PDF]

Fundamenta Informaticae, 2009
In this paper we consider the classes REC1 and UREC1 of unary picture languages that are tiling recognizable and unambiguously tiling recognizable, respectively. By representing unary pictures by quasi-unary strings we characterize REC1 (resp. UREC1) as the class of quasi-unary languages recognized by nondeterministic (resp. unambiguous)
Violetta Lonati, Massimiliano Goldwurm, Alberto Bertoni   +2 more
exaly   +3 more sources

Recognizable Picture Languages and Polyominoes [PDF]

, 2007
We consider the problem of recognizability of some classes of polyominoes in the theory of picture languages. In particular we focus our attention on the problem posed by Matz of finding a nonrecognizable picture language for which his technique for proving the non-recognizability of picture languages fails.
Castiglione G., Vaglica R.
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

RECOGNIZABLE PICTURE LANGUAGES

Series in Machine Perception and Artificial Intelligence, 1992
The purpose of this paper is to propose a new notion of recognizability for picture (two-dimensional) languages extending the characterization of one-dimensional recognizable languages in terms of local languages and alphabetic mappings. We first introduce the family of local picture languages (denoted by LOC) and, in particular, prove the ...
Antonio Restivo
exaly   +2 more sources

LEARNING OF RECOGNIZABLE PICTURE LANGUAGES

International Journal of Pattern Recognition and Artificial Intelligence, 1992
Learning of certain classes of two-dimensional picture languages is considered in this paper. Linear time algorithms that learn in the limit, from positive data the classes of local picture languages and locally testable picture languages are presented.
Rani Siromoney, Lisa Mathew, K. G. Subramanian 0001, V. Rajkumar Dare   +3 more
openaire   +1 more source