7820 search results - page 220 / 1564 » Formalization of Time and Space |
186
click to vote
ECSQARU
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
170
click to vote
SWAT
1992
Springer
15 years 11 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
209
click to vote
CIKM
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
222
click to vote
JACM
2002
15 years 6 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
194
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
This paper presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces (RKHS). Unlike previous approaches that exploit the kernel trick on filtered ...