Sciweavers

1347 search results - page 57 / 270
» On the Structure of the Minimum Time Function
Sort
View
COCOON
2009
Springer
14 years 3 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
SIGPRO
2011
229views Hardware» more  SIGPRO 2011»
13 years 4 months ago
Fast and exact synthesis of stationary multivariate Gaussian time series using circulant embedding
A fast and exact procedure for the numerical synthesis of stationary multivariate Gaussian time series with a priori prescribed and well controlled autoand cross-covariance functi...
Hannes Helgason, Vladas Pipiras, Patrice Abry
BMCBI
2007
109views more  BMCBI 2007»
13 years 9 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
WCE
2007
13 years 10 months ago
Recursive Linear Estimation for Doubly Stochastic Poisson Processes
Abstract— The problem of estimating the intensity process of a doubly stochastic Poisson process is analyzed. Using covariance information, a recursive linear minimum mean-square...
Rosa M. Fernández-Alcalá, Jesú...
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 8 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...