Sciweavers

5785 search results - page 1146 / 1157
» Approximability of Probability Distributions
Sort
View
EOR
2010
88views more  EOR 2010»
15 years 1 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
BMCBI
2006
118views more  BMCBI 2006»
15 years 1 months ago
Microarray image analysis: background estimation using quantile and morphological filters
Background: In a microarray experiment the difference in expression between genes on the same slide is up to 103 fold or more. At low expression, even a small error in the estimat...
Anders Bengtsson, Henrik Bengtsson
CCR
2006
122views more  CCR 2006»
15 years 1 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 1 months ago
Rational stochastic languages
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
François Denis, Yann Esposito
CAGD
2007
156views more  CAGD 2007»
15 years 1 months ago
A control polygon scheme for design of planar C2 PH quintic spline curves
A scheme to specify planar C2 Pythagorean-hodograph (PH) quintic spline curves by control polygons is proposed, in which the “ordinary” C2 cubic B-spline curve serves as a ref...
Francesca Pelosi, Maria Lucia Sampoli, Rida T. Far...
« Prev « First page 1146 / 1157 Last » Next »