Sciweavers

210 search results - page 1 / 42
» On association schemes all elements of which have valency 1 ...
Sort
View
DM
2008
129views more  DM 2008»
13 years 4 months ago
On association schemes all elements of which have valency 1 or 2
In the present note, we investigate schemes S in which each element s satisfies ns 2 and nss = 2. We show that such a scheme is schurian. More precisely, we show that it is isomor...
Mikhail E. Muzychuk, Paul-Hermann Zieschang
BMCBI
2008
111views more  BMCBI 2008»
13 years 4 months ago
VisualRepbase: an interface for the study of occurrences of transposable element families
Background: Repbase is a reference database of eukaryotic repetitive DNA, which includes prototypic sequences of repeats and basic information described in annotations. Repbase al...
Sébastien Tempel, Matthew Jurka, Jerzy Jurk...
JCIT
2008
128views more  JCIT 2008»
13 years 4 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya
IACR
2011
173views more  IACR 2011»
12 years 4 months ago
All-But-Many Lossy Trapdoor Functions
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
Dennis Hofheinz
TIT
2002
126views more  TIT 2002»
13 years 4 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy