Sciweavers

74 search results - page 6 / 15
» esas 2006
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
13 years 11 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
13 years 9 months ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
13 years 11 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...
ESA
2006
Springer
112views Algorithms» more  ESA 2006»
13 years 11 months ago
Enumerating Spanning and Connected Subsets in Graphs and Matroids
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...