Browsing by Keywords "Data structures"
Now showing items 120 of 29

Adaptive decomposition and remapping algorithms for objectspaceparallel direct volume rendering of unstructured grids
(Academic Press, 200701)Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributedmemory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ... 
Binary morphological subband decomposition for image coding
(IEEE, Piscataway, NJ, United States, 1996)In this paper a binary waveform coding method based on morphological subband decomposition coupled with embedded zerotree and entropy coding is described. This method can be utilized in text compression or bitplane coding ... 
CAPSULE: Language and system support for efficient state sharing in distributed stream processing systems
(2012)Data stream processing applications are often expressed as data flow graphs, composed of operators connected via streams. This structured representation provides a simple yet powerful paradigm for building largescale, ... 
A comparison of historical relational query languages
(ASME, 1994)We introduce a historical relational data model in which N1NF relations are used and 1level of nesting is allowed. Attributes can either be atomic or temporal atom. An atomic attribute represents a time invariant attribute. ... 
Computational pangenomics: status, promises and challenges
(Oxford University Press, 20180101)Many disciplines, from human genetics and oncology to plant breeding, microbiology and virology, commonly face the challenge of analyzing rapidly increasing numbers of genomes. In case of Homo sapiens, the number of ... 
Distancebased classification methods
(Taylor & Francis, 1999)Given a set of points in a Euclidean space, and a partitioning of this 'training set' into two or more subsets ('classes'), we consider the problem of identifying a 'reasonable' assignment of another point in the Euclidean ... 
Editing heightfield using history management and 3D widgets
(2009)In virtual environments, terrain is generally modeled by heightfield, a 2D structure. To be able to create desired terrain geometry, software editors for this specific task have been developed. The graphics hardware, data ... 
Effective use of space for pivotbased metric indexing structures
(2008)Among the metric space indexing methods, AESA is known to produce the lowest query costs in terms of the number of distance computations. However, its quadratic construction cost and space consumption makes it infeasiblefor ... 
Efficiency and effectiveness of query processing in clusterbased retrieval
(Elsevier, 2004)Our research shows that for large databases, without considerable additional storage overhead, clusterbased retrieval (CBR) can compete with the time efficiency and effectiveness of the inverted indexbased full search ... 
An efficient algorithm for the single machine total tardiness problem
(Taylor & Francis, 2001)This paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job ... 
Efficient parallel spatial subdivision algorithm for objectbased parallel ray tracing
(Pergamon Press, 1994)Parallel ray tracing of complex scenes on multicomputers requires the distribution of both computation and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. ... 
Efficient vectorization of forward/backward substitutions in solving sparse linear equations
(IEEE, 1994)Vector processors have promised an enormous increase in computing speed for computationally intensive and timecritical power system problems which require the repeated solution of sparse linear equations. Due to short ... 
FAME: Face Association through Model Evolution
(IEEE Computer Society, 2014)We attack the problem of building classifiers for public faces from web images collected through querying a name. The search results are very noisy even after face detection, with several irrelevant faces corresponding to ... 
Human action recognition using distribution of oriented rectangular patches
(2007)We describe a "bagofrectangles" method for representing and recognizing human actions in videos. In this method, each human pose in an action sequence is represented by oriented rectangular patches extracted over the ... 
Incremental materialization of objectoriented views
(Elsevier, 1999)We present an approach to handle incremental materialization of objectoriented views. Queries that define views are implemented as methods that are invoked to compute corresponding views. To avoid computation from scratch ... 
Lossless image compression by LMS adaptive filter banks
(Elsevier, 2001)A lossless image compression algorithm based on adaptive subband decomposition is proposed. The subband decomposition is achieved by a twochannel LMS adaptive filter bank. The resulting coefficients are lossy coded first, ... 
Mars: A toolbased modeling, animation, and parallel rendering system
(Springer, 1994)This paper describes a system for modeling, animating, previewing and rendering articulated objects. The system has a modeler of objects that consists of joints and segments. The animator interactively positions the ... 
MLFMA memory reduction techniques for solving largescale problems
(Institute of Electrical and Electronics Engineers Inc., 2014)We present two memory reduction methods for the parallel multilevel fast multipole algorithm. One of these methods uses data structures out of core, and the other parallelizes the data structures related to input geometry. ... 
Morphological subband decomposition structure using GF(N) arithmetic
(IEEE, Los Alamitos, CA, United States, 1996)Linear filter banks with critical subsampling and perfect reconstruction (PR) property have received much interest and found numerous applications in signal and image processing. Recently, nonlinear filter bank structures ... 
Multirelational kanonymity
(2007)kAnonymity protects privacy by ensuring that data cannot be linked to a single individual. In a kanonymous dataset, any identifying information occurs in at least k tuples. Much research has been done to modify a single ...