2252 search results - page 118 / 451 » Lower Bounds for Dynamic Algorithms |
134
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
120
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
134
click to vote
ESA
2004
Springer
15 years 7 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
127
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
133
Voted
STOC
1999
ACM
15 years 7 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...