Sciweavers

1142 search results - page 33 / 229
» Approximability of Clausal Constraints
Sort
View
RECOMB
2002
Springer
16 years 2 months ago
Approximate matching of secondary structures
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
Nadia El-Mabrouk, Mathieu Raffinot
ADCM
2007
104views more  ADCM 2007»
15 years 2 months ago
Shape preserving histogram approximation
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
Paolo Costantini, Francesca Pelosi
IWDW
2005
Springer
15 years 7 months ago
On the Achievable Rate of Side Informed Embedding Techniques with Steganographic Constraints
The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework the...
Mark T. Hogan, Félix Balado, Neil J. Hurley...
SIAMCO
2002
71views more  SIAMCO 2002»
15 years 1 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
COCOON
2001
Springer
15 years 6 months ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer