Sciweavers

330 search results - page 36 / 66
» Intersection and Union Types
Sort
View
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
14 years 14 days ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain
DAC
1999
ACM
13 years 12 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
SPAA
1998
ACM
13 years 12 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
ISCOPE
1997
Springer
13 years 11 months ago
Client/Server Architecture in the ADAMS Parallel Object-Oriented Database System
This paper describes issues encountered in the design and implementation of a parallel object-oriented database system. In particular, we find that the design of a client/server ...
Russell F. Haddleton, John L. Pfaltz
ICPIA
1992
13 years 11 months ago
Parallel Manipulations of Octrees and Quadtrees
Abstract. Octrees o er a powerful means for representing and manipulating 3-D objects. This paper presents an implementation of octree manipulations using a new approach on a share...
Vipin Chaudhary, K. Kamath, Prakash Arunachalam, J...