Sciweavers

851 search results - page 18 / 171
» Random constructions and density results
Sort
View
BMCBI
2002
119views more  BMCBI 2002»
13 years 8 months ago
Microarray results: how accurate are they?
Background: DNA microarray technology is a powerful technique that was recently developed in order to analyze thousands of genes in a short time. Presently, microarrays, or chips,...
Ravi Kothapalli, Sean J. Yoder, Shrikant Mane, Tho...
COMBINATORICS
2000
88views more  COMBINATORICS 2000»
13 years 8 months ago
Note on Sparse Random Graphs and Cover Graphs
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
Tom Bohman, Alan M. Frieze, Miklós Ruszink&...
CCS
2007
ACM
14 years 2 months ago
New constructions of fuzzy identity-based encryption
In this paper we construct two new fuzzy identity-based encryption (IBE) schemes in the random oracle model. Not only do our schemes provide public parameters whose size is indepe...
Joonsang Baek, Willy Susilo, Jianying Zhou
CDC
2008
IEEE
14 years 2 months ago
Convex duality and entropy-based moment closures: Characterizing degenerate densities
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
Cory D. Hauck, C. David Levermore, André L....
STACS
2012
Springer
12 years 4 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...