Sciweavers

853 search results - page 158 / 171
» Are many small sets explicitly small
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 11 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
IJCAI
1997
13 years 11 months ago
Change, Change, Change: Three Approaches
We consider the frame problem, that is, char­ acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...
Tom Costello
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 10 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
BMCBI
2007
136views more  BMCBI 2007»
13 years 10 months ago
Genomorama: genome visualization and analysis
Background: The ability to visualize genomic features and design experimental assays that can target specific regions of a genome is essential for modern biology. To assist in the...
Jason D. Gans, Murray Wolinsky
BMCBI
2007
135views more  BMCBI 2007»
13 years 10 months ago
Detecting multivariate differentially expressed genes
Background: Gene expression is governed by complex networks, and differences in expression patterns between distinct biological conditions may therefore be complex and multivariat...
Roland Nilsson, José M. Peña, Johan ...