4315 search results - page 152 / 863 » Sorting in linear time |
ECCC
2011
13 years 19 days ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
ICCAD
2006
IEEE
14 years 6 months ago
2006
IEEE
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
UAI
2008
13 years 10 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
RANDOM
1999
Springer
14 years 1 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...