1279 search results - page 152 / 256 » Fast Implementations of Automata Computations |
100
Voted
UAI
1997
15 years 4 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...
128
Voted
PERVASIVE
2008
Springer
15 years 3 months ago
2008
Springer
The Context Recognition Network (CRN) Toolbox permits fast implementation of activity and context recognition systems. It utilizes parameterizable and reusable software components...
149
Voted
DCC
2000
IEEE
15 years 3 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
144
Voted
TOG
2002
15 years 3 months ago
2002
This paper introduces an efficient two-pass rendering technique for translucent materials. We decouple the computation of irradiance at the surface from the evaluation of scatteri...
107
Voted
MICS
2007
15 years 2 months ago
2007
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...