1523 search results - page 182 / 305 » The Computational Complexity of Linear Optics |
123
click to vote
AUSAI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
135
click to vote
RSS
2007
15 years 5 months ago
2007
—In this paper we show that all processes associated to the move-sense-update cycle of EKF SLAM can be carried out in time linear in the number of map features. We describe Divid...
142
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 5 months ago
2010
Eurographics
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
138
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
139
click to vote
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...