A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
William F. Garrett, Henry Fuchs, Mary C. Whitton, ...
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...