Sciweavers

3825 search results - page 147 / 765
» More on pooling spaces
Sort
View
JEA
2008
112views more  JEA 2008»
14 years 10 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
PAMI
2008
215views more  PAMI 2008»
14 years 10 months ago
Evaluating Shape Correspondence for Statistical Shape Analysis: A Benchmark Study
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-co...
Brent C. Munsell, Pahal Dalal, Song Wang
LAMAS
2005
Springer
15 years 3 months ago
Multi-agent Relational Reinforcement Learning
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...
Tom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice ...
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods
ARITH
2001
IEEE
15 years 1 months ago
Some Improvements on Multipartite Table Methods
This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite methods. This new definition allows a more ac...
Florent de Dinechin, Arnaud Tisserand