Sciweavers

WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
14 years 1 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
VLDB
1995
ACM
89views Database» more  VLDB 1995»
14 years 1 months ago
OODB Bulk Loading Revisited: The Partitioned-List Approach
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
Janet L. Wiener, Jeffrey F. Naughton
VLDB
1995
ACM
163views Database» more  VLDB 1995»
14 years 1 months ago
An Efficient Algorithm for Mining Association Rules in Large Databases
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...
VLDB
1995
ACM
113views Database» more  VLDB 1995»
14 years 1 months ago
Efficient Incremental Garbage Collection for Client-Server Object Database Systems
We describe an eficient server-based algorithm for garbage collecting object-oriented databases in a client/server environment. The algorithm is incremental and runs concurrently ...
Laurent Amsaleg, Michael J. Franklin, Olivier Grub...
VISUALIZATION
1995
IEEE
14 years 1 months ago
Sweeping Simplices: A Fast Iso-Surface Extraction Algorithm for Unstructured Grids
We present an algorithm that accelerates the extraction of iso-surfaces from unstructured grids by avoiding the traversal of the entire set of cells in the volume. The algorithm c...
Han-Wei Shen, Christopher R. Johnson
SSD
1995
Springer
97views Database» more  SSD 1995»
14 years 1 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
14 years 1 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
SIGGRAPH
1995
ACM
14 years 1 months ago
An interactive tool for placing curved surfaces without interpenetration
We present a surface representation and a set of algorithms that allow interactive placement of curved parametric objects without interpenetration. Using these algorithms, a model...
John M. Snyder
RTCSA
1995
IEEE
14 years 1 months ago
A soft aperiodic task scheduling algorithm in dynamic-priority systems
In this paper, we present a joint scheduling of hard deadline periodic and soft deadline aperiodic tasks in dynamic-priority systems. The proposed algorithm has extended the fixed...
Sungyoung Lee, Hyungill Kim, Jongwon Lee
POPL
1995
ACM
14 years 1 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip