Sciweavers

1578 search results - page 236 / 316
» Algorithmic randomness of continuous functions
Sort
View
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 8 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
AIEDAM
1998
87views more  AIEDAM 1998»
13 years 8 months ago
Learning to set up numerical optimizations of engineering designs
Gradient-based numerical optimization of complex engineering designs offers the promise of rapidly producing better designs. However, such methods generally assume that the object...
Mark Schwabacher, Thomas Ellman, Haym Hirsh
TCIAIG
2010
13 years 3 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
RECOMB
2002
Springer
14 years 9 months ago
A new approach to analyzing gene expression time series data
We present algorithms for time-series gene expression analysis that permit the principled estimation of unobserved timepoints, clustering, and dataset alignment. Each expression p...
Ziv Bar-Joseph, Georg Gerber, David K. Gifford, To...
INFOCOM
2009
IEEE
14 years 3 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li