606 search results - page 73 / 122 » Discrete Time Process Algebra |
COMPGEOM
2007
ACM
15 years 5 months ago
2007
ACM
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
109
click to vote
AAAI
2006
15 years 3 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
130
click to vote
EUROPAR
2011
Springer
14 years 1 months ago
2011
Springer
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
133
click to vote
AUTOMATICA
2010
15 years 1 months ago
2010
This paper describes a new kernel-based approach for linear system identification of stable systems. We model the impulse response as the realization of a Gaussian process whose s...
147
Voted
ICIP
2010
IEEE
14 years 11 months ago
2010
IEEE
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...