1461 search results - page 150 / 293 » The Cost of Cache-Oblivious Searching |
189
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
230
click to vote
DBA
2006
15 years 7 months ago
2006
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
161
click to vote
AAAI
1998
15 years 7 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
178
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
176
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...