Sciweavers

1168 search results - page 131 / 234
» cases 2000
Sort
View
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 1 months ago
K-D Trees Are Better when Cut on the Longest Side
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....
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 1 months ago
Generating highly-routable sparse crossbars for PLDs
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...
Guy G. Lemieux, Paul Leventis, David M. Lewis
FSTTCS
2000
Springer
15 years 1 months ago
Text Sparsification via Local Maxima
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...
ICSE
2000
IEEE-ACM
15 years 1 months ago
Testing: a roadmap
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...
Mary Jean Harrold
IMR
2000
Springer
15 years 1 months ago
An Angle-Based Approach to Two-Dimensional Mesh Smoothing
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...
Tian Zhou, Kenji Shimada