2252 search results - page 282 / 451 » Improving Random Forests |
106
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
ICRA
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
95
Voted
ASPDAC
2006
ACM
15 years 6 months ago
2006
ACM
— The main thesis of this paper is to perform a reliability based performance analysis for a shared latch inserted global interconnect under uncertainty. We first put forward a ...
126
click to vote
VALUETOOLS
2006
ACM
15 years 6 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
136
click to vote
ICPP
2005
IEEE
15 years 6 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...