3096 search results - page 200 / 620 » The Generalized FITC Approximation |
123
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
141
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
135
click to vote
ATVA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
160
Voted
SIAMJO
2008
15 years 5 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
133
Voted
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Research on bias in machine learning algorithms has generally been concerned with the impact of bias on predictive accuracy. We believe that there are other factors that should al...