Sciweavers

10 search results - page 1 / 2
» Term-graph Rewriting in Tom Using Relative Positions
Sort
View
ENTCS
2008
114views more  ENTCS 2008»
13 years 4 months ago
Term-graph Rewriting in Tom Using Relative Positions
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...
Emilie Balland, Paul Brauner
AMAST
2008
Springer
13 years 6 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
IVC
2008
203views more  IVC 2008»
13 years 4 months ago
Multi-modal tracking using texture changes
We present a method for efficiently generating a representation of a multi-modal posterior probability distribution. The technique combines ideas from RANSAC and particle filterin...
Christopher Kemp, Tom Drummond
ICRA
2005
IEEE
140views Robotics» more  ICRA 2005»
13 years 10 months ago
Fast Reinforcement Learning for Vision-guided Mobile Robots
— This paper presents a new reinforcement learning algorithm for accelerating acquisition of new skills by real mobile robots, without requiring simulation. It speeds up Q-learni...
Tomás Martínez-Marín, Tom Duc...
MEDIAFORENSICS
2010
13 years 6 months ago
Minimizing embedding impact in steganography using trellis-coded quantization
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance...
Tomás Filler, Jan Judas, Jessica J. Fridric...