Results 261 to 270 of about 3,507,644 (308)
Identification of Invasive Aspergillosis in Electronic Health Records. [PDF]
Open Forum Infect DisRayens E +5 more
europepmc +1 more source
Automating clinical trial outcome identification and misreporting detection using RegCheck
Cummins J +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Information Theory, 2012
We consider the problem of generating a connected identifying code for an arbitrary graph. After a brief motivation, we show that the decision problem regarding the existence of such a code is NP-complete, and we propose a novel polynomial-time approximation ConnectID that transforms any identifying code into a connected version of at most twice the ...
Niloofar Fazlollahi +2 more
openaire +2 more sources
We consider the problem of generating a connected identifying code for an arbitrary graph. After a brief motivation, we show that the decision problem regarding the existence of such a code is NP-complete, and we propose a novel polynomial-time approximation ConnectID that transforms any identifying code into a connected version of at most twice the ...
Niloofar Fazlollahi +2 more
openaire +2 more sources
Cognitive Psychology, 1980
Models of speech processing typically assume that speech is represented by a succession of codes. In this paper we argue for the psychological validity of a prelexical (phonetic) code and for a postlexical (phonological) code. Whereas phonetic codes are computed directly from an analysis of input acoustic information, phonological codes are derived ...
D J, Foss, M A, Blank
openaire +2 more sources
Models of speech processing typically assume that speech is represented by a succession of codes. In this paper we argue for the psychological validity of a prelexical (phonetic) code and for a postlexical (phonological) code. Whereas phonetic codes are computed directly from an analysis of input acoustic information, phonological codes are derived ...
D J, Foss, M A, Blank
openaire +2 more sources
On robust and dynamic identifying codes
IEEE Transactions on Information Theory, 2006A subset C of vertices in an undirected graph G=(V,E) is called a 1-identifying code if the sets I(v)={u/spl isin/C:d(u,v)/spl les/1}, v/spl isin/V, are nonempty and no two of them are the same set. It is natural to consider classes of codes that retain the identification property under various conditions, e.g., when the sets I(v) are possibly slightly
I Honkala
exaly +3 more sources
Bounds on the Identifying Codes in Trees
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hadi Rahbani +2 more
openaire +3 more sources
On the Size of Identifying Codes
1999A code is called t-identifying if the sets Bt(x) ∩ C are all nonempty and different. Constructions of 1-identifying codes and lower bounds on the minimum cardinality of a 1-identifying code of length n are given.
Uri Blass, Iiro S. Honkala, Simon Litsyn
openaire +2 more sources