Sciweavers

15254 search results - page 331 / 3051
» A k
Sort
View
STOC
2001
ACM
139views Algorithms» more  STOC 2001»
16 years 7 months ago
Approximate distance oracles
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
Mikkel Thorup, Uri Zwick
VLDB
2008
ACM
76views Database» more  VLDB 2008»
16 years 7 months ago
Query processing of multi-way stream window joins
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmaga...
VLDB
2009
ACM
142views Database» more  VLDB 2009»
16 years 7 months ago
Hierarchically compressed wavelet synopses
Dimitris Sacharidis, Antonios Deligiannakis, Timos...
SIGMOD
2009
ACM
136views Database» more  SIGMOD 2009»
16 years 7 months ago
Optimizing i/o-intensive transactions in highly interactive applications
Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandro...
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
16 years 7 months ago
GPUTeraSort: high performance graphics co-processor sorting for large database management
Naga K. Govindaraju, Jim Gray, Ritesh Kumar, Dines...