7978 search results - page 449 / 1596 » Combining shared-coin algorithms |
185
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only...
185
click to vote
NIPS
2003
15 years 8 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
147
click to vote
ANLP
2000
15 years 8 months ago
2000
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
194
click to vote
BMVC
1998
15 years 8 months ago
1998
We investigate a holistic approach to real-time gaze tracking by means of a well-defined neural network modelling strategy combined with robust image processing algorithms. Based ...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...