2714 search results - page 197 / 543 » Approximation Schemes for Scheduling |
127
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
146
click to vote
DOLAP
2005
ACM
15 years 5 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
144
click to vote
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
131
click to vote
AMC
2004
15 years 3 months ago
2004
A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an...
137
click to vote
SIAMIS
2011
14 years 10 months ago
2011
In this paper we study finite-difference approximations to the variational problem using the BV smoothness penalty that was introduced in an image smoothing context by Rudin, Osh...