397 search results - page 41 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
COR
2008
13 years 7 months ago
2008
An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotinecutting problems of rectangles. It is based on branch...
NETWORKS
2006
13 years 7 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
ICALP
2009
Springer
14 years 2 months ago
2009
Springer
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...