Sciweavers

11211 search results - page 1755 / 2243
» Rank-Sensitive Data Structures
Sort
View
GIS
1995
ACM
15 years 8 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
IRREGULAR
1995
Springer
15 years 8 months ago
Run-Time Parallelization of Irregular DOACROSS Loops
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mar...
116
Voted
STACS
1995
Springer
15 years 8 months ago
Generalized Scans and Tri-Diagonal Systems
Motivatedby the analysis of known parallel techniques for the solution of linear tridiagonal system, we introduce generalized scans, a class of recursively de ned lengthpreserving...
Paul F. Fischer, Franco P. Preparata, John E. Sava...
VLDB
1995
ACM
116views Database» more  VLDB 1995»
15 years 8 months ago
W3QS: A Query System for the World-Wide Web
The World-Wide Web (WWW) is an ever growing, distributed, non-administered, global information resource. It resides on the worldwide computer network and allows access to heteroge...
David Konopnicki, Oded Shmueli
COMPGEOM
1991
ACM
15 years 8 months ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
David Avis, Komei Fukuda
« Prev « First page 1755 / 2243 Last » Next »