2531 search results - page 173 / 507 » Group testing in graphs |
221
click to vote
IJDAR
2006
15 years 6 months ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
150
click to vote
JCO
2010
15 years 4 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
186
click to vote
BIOCOMP
2008
15 years 7 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
176
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
159
click to vote
IASTEDSEA
2004
15 years 7 months ago
2004
This paper proposes a service-oriented software reliability model that dynamically evaluates the reliability of Web services. There are two kinds of Web services: atomic services ...