8600 search results - page 698 / 1720 » Measuring with Timed Patterns |
220
click to vote
CORR
1999
Springer
15 years 7 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
169
click to vote
PR
2002
15 years 7 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
173
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
195
click to vote
ICMLA
2009
15 years 5 months ago
2009
This paper describes a novel real-world reinforcement learning application: The Neuro Slot Car Racer. In addition to presenting the system and first results based on Neural Fitted...
149
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
We propose a correlogram-based time delay estimation method using signals modeled as the output of the cochlea, where the low-level signal processing happens in the human auditory...