516 search results - page 97 / 104 » Generalizing the Discrete Timed Automaton |
SIGGRAPH
1993
ACM
14 years 1 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
AIME
2009
Springer
14 years 1 months ago
2009
Springer
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
ENTCS
2007
13 years 9 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
GIS
2006
ACM
14 years 11 months ago
2006
ACM
Creating complex spatio?temporal simulation models is a hot issue in the area of spatio?temporal databases [7]. While existing Moving Object Simulators (MOSs) address different ph...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...