Sciweavers

461 search results - page 26 / 93
» Practical polynomial factoring in polynomial time
Sort
View
67
Voted
PODS
2003
ACM
104views Database» more  PODS 2003»
15 years 9 months ago
Maintaining time-decaying stream aggregates
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
Edith Cohen, Martin Strauss
69
Voted
COLT
2001
Springer
15 years 2 months ago
Learning Rates for Q-Learning
In this paper we derive convergence rates for Q-learning. We show an interesting relationship between the convergence rate and the learning rate used in Q-learning. For a polynomi...
Eyal Even-Dar, Yishay Mansour
ISVLSI
2002
IEEE
129views VLSI» more  ISVLSI 2002»
15 years 2 months ago
Accelerating Retiming Under the Coupled-Edge Timing Model
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
Ingmar Neumann, Kolja Sulimma, Wolfgang Kunz
COMPGEOM
2001
ACM
15 years 1 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
14 years 11 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris