Sciweavers

18 search results - page 1 / 4
» On the structure of 1-designs with at most two block interse...
Sort
View
DCC
2007
IEEE
14 years 4 months ago
On the structure of 1-designs with at most two block intersection numbers
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
John Arhin
GMP
2002
IEEE
172views Solid Modeling» more  GMP 2002»
13 years 9 months ago
Classifying the Nonsingular Intersection Curve of Two Quadric Surfaces
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
Changhe Tu, Wenping Wang, Jiaye Wang
DAM
2006
102views more  DAM 2006»
13 years 4 months ago
Secret sharing schemes on access structures with intersection number equal to one
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
Jaume Martí-Farré, Carles Padr&oacut...
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 4 months ago
OrthoCluster: a new tool for mining synteny blocks and applications in comparative genomics
By comparing genomes among both closely and distally related species, comparative genomics analysis characterizes structures and functions of different genomes in both conserved a...
Xinghuo Zeng, Matthew J. Nesbitt, Jian Pei, Ke Wan...
DM
2006
128views more  DM 2006»
13 years 4 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck