Sciweavers

2766 search results - page 34 / 554
» Algorithms for trigonometric polynomials
Sort
View
COLT
2005
Springer
15 years 6 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
69
Voted
DAM
2006
68views more  DAM 2006»
15 years 20 days ago
A strongly polynomial algorithm for solving two-sided linear systems in max-algebra
An algorithm for solving m
Peter Butkovic, Karel Zimmermann
SIGACT
2010
74views more  SIGACT 2010»
14 years 11 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
13 years 3 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...