Sciweavers

171 search results - page 34 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
ASIACRYPT
2000
Springer
13 years 10 months ago
Cryptanalysis of the TTM Cryptosystem
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
Louis Goubin, Nicolas Courtois
BMCBI
2007
154views more  BMCBI 2007»
13 years 6 months ago
Classification of heterogeneous microarray data by maximum entropy kernel
Background: There is a large amount of microarray data accumulating in public databases, providing various data waiting to be analyzed jointly. Powerful kernel-based methods are c...
Wataru Fujibuchi, Tsuyoshi Kato
BMCBI
2007
107views more  BMCBI 2007»
13 years 6 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
TIT
2008
83views more  TIT 2008»
13 years 6 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 5 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer