We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
Testing is an important process that is performed to support quality assurance. Testing activities support quality assurance by gathering information about the nature of the softw...
We present an effective and easy-to-implement angle-based smoothing scheme for triangular, quadrilateral and tri-quad mixed meshes. For each mesh node our algorithm compares all t...