2252 search results - page 151 / 451 » Lower Bounds for Dynamic Algorithms |
125
click to vote
SIGMETRICS
2005
ACM
15 years 9 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
123
Voted
SDM
2010
SIAM
15 years 4 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
160
Voted
IJRR
2011
14 years 10 months ago
2011
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
145
Voted
NIPS
1998
15 years 4 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
137
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...