Sciweavers

312 search results - page 48 / 63
» Indexing Gapped-Factors Using a Tree
Sort
View
FOCS
2009
IEEE
14 years 1 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
CG
2006
Springer
13 years 10 months ago
Interactive out-of-core isosurface visualisation in time-varying data sets
We present a combination of techniques for interactive out-of-core visualisation of isosurfaces from large timedependent data sets. We make use of an index tree, computed in a pre...
Benjamin Vrolijk, Frits H. Post
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
13 years 7 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 10 months ago
GPUQP: query co-processing using graphics processors
We present GPUQP, a relational query engine that employs both CPUs and GPUs (Graphics Processing Units) for in-memory query co-processing. GPUs are commodity processors traditiona...
Rui Fang, Bingsheng He, Mian Lu, Ke Yang, Naga K. ...
SSD
2005
Springer
105views Database» more  SSD 2005»
14 years 3 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis