4315 search results - page 119 / 863 » Sorting in linear time |
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
This paper proves ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
ADBIS
2009
Springer
14 years 1 months ago
2009
Springer
Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that descri...
DLT
2008
13 years 10 months ago
2008
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
VLDB
1999
ACM
14 years 1 months ago
1999
ACM
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...