16404 search results - page 779 / 3281 » A set coverage problem |
280
Voted
NETWORKS
2011
15 years 2 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
201
click to vote
JMLR
2010
15 years 2 months ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
186
click to vote
SIAMCO
2010
15 years 2 months ago
2010
We study a class of Markovian optimal stochastic control problems in which the controlled process Z is constrained to satisfy an a.s. constraint Z (T) G Rd+1 P - a.s. at some fi...
228
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
196
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
In this paper, we propose an adaptive time-frequency resolution approach for the single channel source separation problem. The aim is to improve the quality and intelligibility of...