Sciweavers

83 search results - page 9 / 17
» dam 2006
Sort
View
DAM
2006
97views more  DAM 2006»
14 years 12 months ago
Fully dynamic recognition algorithm and certificate for directed cographs
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
Christophe Crespelle, Christophe Paul
DAM
2006
63views more  DAM 2006»
14 years 12 months ago
A novel use of t-packings to construct d-disjunct matrices
A t-packing is an ordered pair (V, P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-...
Hung-Lin Fu, Frank K. Hwang
DAM
2006
63views more  DAM 2006»
14 years 12 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
DAM
2006
61views more  DAM 2006»
14 years 12 months ago
On error-tolerant DNA screening
Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outco...
Weili Wu, Yaochun Huang, Xiao Huang, Yingshu Li
DAM
2007
83views more  DAM 2007»
14 years 12 months ago
The proof theoretic strength of the Steinitz exchange theorem
We show that the logical theory QLA proves the Cayley–Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Sin...
Michael Soltys