Sciweavers

4894 search results - page 713 / 979
» Dynamic Abstraction Planning
Sort
View
BNCOD
1997
111views Database» more  BNCOD 1997»
15 years 8 months ago
Improved and Optimized Partitioning Techniques in Database Query Processing
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
Kjell Bratbergsengen, Kjetil Nørvåg
IWFM
2000
167views Formal Methods» more  IWFM 2000»
15 years 8 months ago
An Algebraic Basis for Specifying and Enforcing Access Control in Security Systems
Security services in a multi-user environment are often based on access control mechanisms. Static of an access control policy can be formalised using abstract algebraic models. W...
Claus Pahl
VMV
2000
169views Visualization» more  VMV 2000»
15 years 8 months ago
Automatic Adjustment of Transfer Functions for 3D Volume Visualization
In most volume rendering scenarios implicit classification is performed manually by specification of a transfer function, that maps abstract data values to visual attributes. An a...
Christof Rezk-Salama, Peter Hastreiter, Jörg ...
CCCG
1993
15 years 8 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink
EUROSIM
1994
15 years 8 months ago
Pact: An Environment for Parallel Heuristic Programming
This paper introduces Pact, a new model for parallel heuristic programming on MIMD machines. Designed and implemented as an integrated tool environment, Pact allows the user to dev...
Marc Aguilar, Béat Hirsbrunner