2069 search results - page 120 / 414 » Linear time algorithms for Clobber |
157
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
182
click to vote
PATMOS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Until now, the great majority of research in low-power systems has assumed a convex power model. However, recently, due to the confluence of emerging technological and ar...
120
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
117
click to vote
GD
2001
Springer
15 years 8 months ago
2001
Springer
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
134
click to vote
MICS
2010
15 years 2 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...