Sciweavers

1740 search results - page 187 / 348
» Minimal structures for stories
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 1 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
CDC
2010
IEEE
126views Control Systems» more  CDC 2010»
14 years 11 months ago
Bifurcation of singular arcs in an optimal control problem for cancer immune system interactions under treatment
A mathematical model for cancer treatment that includes immunological activity is considered as an optimal control problem. In the uncontrolled system there exist both a region of ...
Urszula Ledzewicz, Mohammad Naghnaeian, Heinz Sch&...
TIT
2011
140views more  TIT 2011»
14 years 11 months ago
Sequential Quantile Prediction of Time Series
Motivated by a broad range of potential applications, we address the quantile prediction problem of real-valued time series. We present a sequential quantile forecasting model bas...
Gérard Biau, Benoît Patra
JMLR
2010
187views more  JMLR 2010»
14 years 10 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause
JPDC
2010
133views more  JPDC 2010»
14 years 10 months ago
Lock-free parallel dynamic programming
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
Alex Stivala, Peter J. Stuckey, Maria Garcia de la...