2570 search results - page 201 / 514 » Fast Algorithms For The Computation Of Ranklets |
135
click to vote
ARITH
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
144
click to vote
ISBI
2004
IEEE
16 years 5 months ago
2004
IEEE
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...
145
click to vote
ICCV
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
133
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this work we tackle the road sign problem with Reservoir Computing (RC) networks. The T-maze task (a particular form of the road sign problem) consists of a robot in a T-sha...
124
click to vote
CAV
2006
Springer
15 years 8 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...