2252 search results - page 407 / 451 » Improving Random Forests |
101
Voted
STOC
2007
ACM
16 years 26 days ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
102
Voted
ICALP
2009
Springer
16 years 25 days ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
116
Voted
ICALP
2009
Springer
16 years 25 days ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
126
Voted
SIGMOD
2002
ACM
16 years 21 days ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
126
Voted
PODS
2005
ACM
16 years 20 days ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...