170 search results - page 23 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
JACM
2006
13 years 7 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
JMLR
2006
13 years 7 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
ICDT
1999
ACM
13 years 11 months ago
1999
ACM
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
NIPS
1997
13 years 9 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....