1066 search results - page 115 / 214 » Computing Private Set Operations with Linear Complexities |
111
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
SIGGRAPH
1993
ACM
15 years 1 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
HPCA
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper presents a new method for branch prediction. The key idea is to use one of the simplest possible neural networks, the perceptron as an alternative to the commonly used ...
SI3D
2003
ACM
15 years 3 months ago
2003
ACM
We present a general joint component framework model that is capable of exhibiting complex behavior of joints in articulated figures. The joints are capable of handling non-ortho...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...