Results 251 to 260 of about 256,860 (287)
Use of claims data to identify adverse events after colonoscopy in a randomised colorectal cancer screening trial in Norway: a cross-sectional study. [PDF]
BMJ OpenRognstad ØB +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Approximability of identifying codes and locating–dominating codes
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jukka Suomela
exaly +2 more sources
Sequences of optimal identifying codes
IEEE Transactions on Information Theory, 2002Summary: Locating faulty processors in a multiprocessor system gives the motivation for identifying codes. Denote by \(l\) the maximum number of simultaneously malfunctioning processors. In this correspondence, we show that if \(l\geq3\), then the problem of finding the smallest cardinality of a \((1,\leq l)\)-identifying code in a binary hypercube is ...
Tero Laihonen
exaly +3 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
Iiro S. Honkala +2 more
exaly +2 more sources
Identifying codes in random networks
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005In this paper we deal with codes identifying sets of vertices in random graphs, that is l-identifying codes. These codes enable us to detect sets of faulty processors in a multiprocessor system, assuming that the maximum number of faulty processors is bounded by a fixed constant l.
Alan Frieze, M Ruszinkó
exaly +2 more sources
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 +1 more source
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 +1 more source