3049 search results - page 495 / 610 » On the Convergence of Bound Optimization Algorithms |
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
ATAL
2006
Springer
14 years 20 days ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
TAPAS
2011
13 years 3 months ago
2011
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...