1945 search results - page 180 / 389 » Speeding up Serpent |
203
click to vote
DAGSTUHL
1997
15 years 7 months ago
1997
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...
187
click to vote
PUK
2000
15 years 7 months ago
2000
Abstract. In the stream of research that aims to speed up practical planners, we propose a new approach to task planning based on Probabilistic Roadmap Methods (PRM). Our contribut...
185
click to vote
VCIP
2000
15 years 7 months ago
2000
Concentric mosaics have the ability to quickly capture a complete 3D view of a realistic environment and to enable a user to wander freely in the environment. However, the data am...
141
click to vote
UAI
1997
15 years 7 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
160
click to vote
UAI
1997
15 years 7 months ago
1997
The Lexical Access Problem consists of determining the intended sequence of words corresponding to an input sequence of phonemes (basic speech sounds) that come from a low-level p...