Sciweavers

4886 search results - page 853 / 978
» Approximate Data Exchange
Sort
View
SIGGRAPH
1996
ACM
14 years 1 months ago
Real-Time, Continuous Level of Detail Rendering of Height Fields
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
Peter Lindstrom, David Koller, William Ribarsky, L...
PLILP
1993
Springer
14 years 1 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
FPGA
1992
ACM
176views FPGA» more  FPGA 1992»
14 years 1 months ago
Minimization of Permuted Reed-Muller Trees for Cellular Logic
The new family of Field Programmable Gate Arrays, CLI6000 from Concurrent Logic Inc realizes the truly Cellular Logic. It has been mainly designed for the realization of data path...
Li-Fei Wu, Marek A. Perkowski
SSD
1993
Springer
112views Database» more  SSD 1993»
14 years 1 months ago
A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
Thomas Brinkhoff, Holger Horn, Hans-Peter Kriegel,...
SIGMOD
1994
ACM
91views Database» more  SIGMOD 1994»
14 years 1 months ago
Estimating Page Fetches for Index Scans with Finite LRU Buffers
We describe an algorithm for estimating the number of page fetches for a partial or complete scan of a B-tree index. The algorithm obtains estimates for the number of page fetches ...
Arun N. Swami, K. Bernhard Schiefer