7716 search results - page 55 / 1544 » Can I pass |
129
Voted
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
129
click to vote
HRI
2010
ACM
15 years 10 months ago
2010
ACM
—Much effort has focused in recent years on developing more life-like robots. In this paper we propose a model of memory for robots, based on human digital memories, though our m...
153
click to vote
IPM
2006
15 years 6 months ago
2006
Structured document retrieval makes use of document components as the basis of the retrieval process, rather than complete documents. The inherent relationships between these comp...
143
click to vote
JGO
2008
15 years 6 months ago
2008
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
136
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...