36 search results - page 4 / 8 » Resizable Arrays in Optimal Time and Space |
SWAT
1992
Springer
14 years 1 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract Oliver Diessel1 and Hossam ElGindy2 1Department of Computer Science and Software Engineering 2Department of Electrical and Computer Engineering The University of Newcastle...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
This paper presents a signal processing tool for analyzing and manipulating digitized acoustic wave fields, based on a spatio-temporal extension of the time–frequency represent...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...