Sciweavers

16404 search results - page 680 / 3281
» A set coverage problem
Sort
View
NPL
2008
68views more  NPL 2008»
15 years 7 months ago
On Nonparametric Residual Variance Estimation
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
Elia Liitiäinen, Francesco Corona, Amaury Len...
WG
2010
Springer
15 years 5 months ago
Efficient Algorithms for Eulerian Extension
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mat...
ICALP
2010
Springer
16 years 17 hour ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
ICASSP
2008
IEEE
16 years 1 months ago
Constrained nonlinear minimum mse estimation
We address the problem of minimum mean-squared error (MMSE) estimation where the estimator is constrained to belong to a prede ned set of functions. We derive a simple closed form...
Tomer Michaeli, Yonina C. Eldar
ECSQARU
2003
Springer
16 years 13 days ago
A Representation Theorem and Applications
We introduce a set of transformations on the set of all probability distributions over a finite state space, and show that these transformations are the only ones that preserve c...
Manfred Jaeger