Sciweavers

1806 search results - page 173 / 362
» Randomness and halting probabilities
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 10 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price
IJCSA
2007
101views more  IJCSA 2007»
13 years 10 months ago
Concurrent Error Detection in S-boxes
In this paper we present low -cost, concurrent checking methods for multiple error detection in S-boxes of symmetric block ciphers. These are redundancy-based fault detection sche...
Ewa Idzikowska, Krzysztof Bucholc
MP
2002
93views more  MP 2002»
13 years 10 months ago
Conditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal s...
Alexander Shapiro, Tito Homem-de-Mello, Joocheol K...
BIOSYSTEMS
2008
102views more  BIOSYSTEMS 2008»
13 years 9 months ago
A computational model for telomere-dependent cell-replicative aging
Telomere shortening provides a molecular basis for the Hayflick limit. Recent data suggest that telomere shortening also influence mitotic rate. We propose a stochastic growth mod...
R. D. Portugal, M. G. P. Land, Benar Fux Svaiter
DM
2008
82views more  DM 2008»
13 years 9 months ago
The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
For two or more classes of points in Rd with d 1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect...
Elvan Ceyhan