11211 search results - page 1789 / 2243 » Data Structures |
181
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
This paper presents new algorithms and techniques for rendering parametric free-form surfaces in pen and ink. In particular, we introduce the idea of "controlled-density hatc...
197
click to vote
IEAAIE
1994
Springer
15 years 11 months ago
1994
Springer
Two recent projects at ORA have used a blackboard framework during system design.1 DANA is a multimedia network monitoring system, while MARRS is a real-time passive radar system....
247
click to vote
SIGGRAPH
1994
ACM
15 years 11 months ago
1994
ACM
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
226
click to vote
SIGSOFT
1994
ACM
15 years 11 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
189
click to vote
WG
1993
Springer
15 years 11 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...