4908 search results - page 650 / 982 » On the Complexity of Optimal K-Anonymity |
179
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
We present a preprocessing algorithm and run-time system for rendering 3D geometric models at a guaranteed frame rate. Our approach trades off space for frame rate by using images...
188
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
153
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...
209
click to vote
ICPADS
1998
IEEE
15 years 11 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
177
click to vote
ICRA
1998
IEEE
15 years 11 months ago
1998
IEEE
For a system of cooperative mobile robots to be effective in real-world applications, it must be able to efficiently execute a wide class of complex tasks in potentially unknown a...