Sciweavers

6365 search results - page 349 / 1273
» Fast Local Computation Algorithms
Sort
View
CGI
2003
IEEE
16 years 1 days ago
"Nijimi" Rendering Algorithm for Creating Quality Black Ink Paintings
The paper presents an interactive painting system for generating high quality and artistic calligraphy characters and black ink paintings. The system is based on our original algo...
Qinglian Guo, Tosiyasu L. Kunii
ARITH
2005
IEEE
15 years 8 months ago
Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization
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...
Khan Wahid, Vassil S. Dimitrov, Graham A. Jullien
186
Voted
ICCV
2003
IEEE
16 years 1 days ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
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...
Paul Smith, Tom Drummond, Kimon Roussopoulos
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
16 years 1 months ago
Mobile robot control in the road sign problem using Reservoir Computing networks
— 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...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
CAV
2006
Springer
105views Hardware» more  CAV 2006»
15 years 10 months ago
FAST Extended Release
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...
Sébastien Bardin, Jérôme Lerou...