Sciweavers

9209 search results - page 316 / 1842
» Data Space Randomization
Sort
View
ML
2002
ACM
100views Machine Learning» more  ML 2002»
15 years 6 months ago
Structure in the Space of Value Functions
Solving in an efficient manner many different optimal control tasks within the same underlying environment requires decomposing the environment into its computationally elemental ...
David J. Foster, Peter Dayan
PAMI
2008
215views more  PAMI 2008»
15 years 6 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
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
16 years 1 months ago
Automatic selection of task spaces for imitation learning
Abstract— Previous work [1] shows that the movement representation in task spaces offers many advantages for learning object-related and goal-directed movement tasks through imit...
Manuel Mühlig, Michael Gienger, Jochen J. Ste...
EUROSYS
2008
ACM
16 years 3 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
16 years 25 days ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...