Sciweavers

317 search results - page 42 / 64
» Computing and Updating the Process Number in Trees
Sort
View
VISUALIZATION
1996
IEEE
14 years 1 months ago
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
Jane Wilhelms, Allen Van Gelder, Paul Tarantino, J...
EDBT
2009
ACM
175views Database» more  EDBT 2009»
14 years 3 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
SAC
2004
ACM
14 years 2 months ago
A parallel algorithm for the extraction of structured motifs
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...
Alexandra M. Carvalho, Arlindo L. Oliveira, Ana T....
IPPS
2006
IEEE
14 years 2 months ago
Topology-aware task mapping for reducing communication contention on large parallel machines
Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies ...
T. Agarwal, Amit Sharma, A. Laxmikant, Laxmikant V...
SSD
2005
Springer
105views Database» more  SSD 2005»
14 years 2 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