2252 search results - page 167 / 451 » Improving Random Forests |
JACM
2010
13 years 6 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
AAAI
2011
12 years 8 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Recently, models based on conditional random fields (CRF) have produced promising results on labeling sequential data in several scientific fields. However, in the vision task of c...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...