Sciweavers

100 search results - page 19 / 20
» Towards a Structured Analysis of Approximate Problem Solving...
Sort
View
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 5 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
WCE
2007
13 years 6 months ago
Scenario Generation Employing Copulas
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
Kristina Sutiene, Henrikas Pranevicius
SIAMADS
2010
63views more  SIAMADS 2010»
13 years 13 hour ago
Time Integration and Steady-State Continuation for 2d Lubrication Equations
Lubrication equations describe many structuring processes of thin liquid films. We develop and apply a numerical framework suitable for their analysis employing a dynamical systems...
Philippe Beltrame, Uwe Thiele
BMCBI
2010
178views more  BMCBI 2010»
13 years 5 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
FOCS
2008
IEEE
13 years 11 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna