3415 search results - page 321 / 683 » Lower bounds on kernelization |
183
click to vote
NIPS
2008
15 years 8 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
170
click to vote
AIPS
2009
15 years 7 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
171
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
168
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
176
click to vote
APAL
2008
15 years 6 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...