1279 search results - page 149 / 256 » Fast Implementations of Automata Computations |
136
Voted
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
We introduce deep shadow maps, a technique that produces fast, high-quality shadows for primitives such as hair, fur, and smoke. Unlike traditional shadow maps, which store a sing...
123
Voted
ISER
1999
Springer
15 years 7 months ago
1999
Springer
In this paper, we present a new approach for continuous probabilistic mapping. The objective is to build metric maps of unknown environments through cooperation between multiple au...
132
Voted
ICDCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
116
Voted
PVM
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. With the growing importance of fast system area networks in the parallel community, it is becoming common for message passing programs to run in multi-programming environ...
137
click to vote
RT
1999
Springer
15 years 7 months ago
1999
Springer
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...