Sciweavers

11219 search results - page 362 / 2244
» Retroactive data structures
Sort
View
VMV
2001
168views Visualization» more  VMV 2001»
15 years 8 months ago
High-quality Volume Rendering of Adaptive Mesh Refinement Data
Adaptive mesh refinement (AMR) is a numerical simulation technique used in computational fluid dynamics (CFD). By using a set of nested grids of different resolutions, AMR combine...
Gunther H. Weber, Oliver Kreylos, Terry J. Ligocki...
ECCC
2007
144views more  ECCC 2007»
15 years 6 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
COMPGEOM
1999
ACM
15 years 11 months ago
The Path of a Triangulation
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
Oswin Aichholzer
ICLP
1999
Springer
15 years 11 months ago
Binding-time Analysis for Mercury
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
Wim Vanhoof, Maurice Bruynooghe
181
Voted
COMPGEOM
2008
ACM
15 years 8 months ago
A simple and efficient kinetic spanner
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
Mohammad Ali Abam, Mark de Berg, Joachim Gudmundss...