Search
Now showing items 1-10 of 28
A Novel Information-Aware Octree for the Visualization of Large Scale Time-Varying Data
(2006-04-20)
Large scale scientific simulations are increasingly generating
very large data sets that present substantial challenges to
current visualization systems. In this paper, we develop a new
scalable and efficient scheme for ...
Prefix Computations on Symmetric Multiprocessors
(1998-10-15)
We introduce a new optimal prefix computation algorithm on linked lists
which builds upon the sparse ruling set approach of Reid-Miller and Blelloch.
Besides being somewhat simpler and requiring nearly half the number of ...
Fast Algorithms for 3-D Dominance Reporting and Counting
(2003-02-05)
We present in this paper fast algorithms for the 3-D dominance reporting
and counting problems, and generalize the results to the d-dimensional
case. Our 3-D dominance reporting algorithm achieves $O(\log n/\log\log ...
An O(n)-Space O(log n/log log n + f)-Query Time Algorithm for 3-D Dominance Reporting
(2003-08-01)
We present a linear-space algorithm for handling the {\em
three-dimensional dominance reporting problem}: given a set $S$ of $n$
three-dimensional points, design a data structure for $S$ so that the
points in $S$ which ...
Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data
(1998-10-15)
Remotely sensed imagery has been used for developing and validating
vairous studies regarding land cover dynamics such as global carbon modeling,
biogeochemical cycling, hydrological modeling, and ecosystem response ...
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
(1998-10-15)
Symmetric multiprocessors (SMPs) dominate the high-end server market and are
currently the primary candidate for constructing large scale multiprocessor
systems. Yet, the design of efficient parallel algorithms for this ...
An On-line Variable Length Binary Encoding
(1998-10-15)
We present a methodology of an on-line variable-length binary
encoding of a set of integers. The basic principle of this methodology is
to maintain the prefix property amongst the codes assigned on-line to a
set of ...
The Block Distributed Memory Model
(1998-10-15)
We introduce a computation model for developing and analyzing
parallel algorithms on distributed memory machines. The model allows
the design of algorithms using a single address space and does not
assume any particular ...
Efficient Isosurface Extraction for Large Scale Time-Varying Data Using the Persistent Hyperoctree (PHOT)
(2006-01-13)
We introduce the Persistent HyperOcTree (PHOT) to handle the
4D isocontouring problem for large scale time-varying data
sets. This novel data structure is provably space
efficient and optimal in retrieving active ...
Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields
(1998-10-15)
This paper introduces scalable data parallel algorithms for image
processing. Focusing on Gibbs and Markov Random Field model
representation for textures, we present parallel algorithms for
texture synthesis, ...