177 search results - page 8 / 36 » Uniform Hashing in Constant Time and Optimal Space |
ALGORITHMICA
2010
13 years 7 months ago
2010
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
GECCO
2003
Springer
14 years 20 days ago
2003
Springer
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thu...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— Semi-blind space-time equalisation is considered for dispersive multiple-input multiple-output systems that employ high-throughput quadrature amplitude modulation signalling. A...
PEPM
2000
ACM
13 years 11 months ago
2000
ACM
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...