330 search results - page 36 / 66 » Intersection and Union Types |
92
Voted
GMP
2010
IEEE
15 years 2 months ago
2010
IEEE
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...
DAC
1999
ACM
15 years 1 months ago
1999
ACM
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...
71
Voted
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
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...
ISCOPE
1997
Springer
15 years 1 months ago
1997
Springer
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 ...
109
click to vote
ICPIA
1992
15 years 1 months ago
1992
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...