Sciweavers

1279 search results - page 55 / 256
» Fast Implementations of Automata Computations
Sort
View
ICIP
2004
IEEE
14 years 9 months ago
Shear-resize factorizations for fast multi-modal volume registration
Intensity-based methods work well for multi-modal image registration owing to their effectiveness and simplicity, but the computation for geometric transforms is a heavy load. To ...
Ying Chen, Pengwei Hao, Jian Yu
ASAP
2006
IEEE
111views Hardware» more  ASAP 2006»
14 years 1 months ago
Fast Bit Compression and Expansion with Parallel Extract and Parallel Deposit Instructions
Current microprocessor instruction set architectures are word oriented, with some subword support. Many important applications, however, can realize substantial performance benefi...
Yedidya Hilewitz, Ruby B. Lee
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
A Fast Approach to Creative Telescoping
Abstract. In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that e...
Christoph Koutschan
ICDIM
2007
IEEE
14 years 2 months ago
Fast Send Protocol - minimizing sending time in high-speed bulk data transfers
Over the last decades Internet traffic has grown dramatically. Besides the number of transfers, data sizes have risen as well. Traditional transfer protocols do not adapt to this...
Christoph Koch, Tilmann Rabl, Günther Hö...
TPHOL
2000
IEEE
14 years 1 days ago
Fast Tactic-Based Theorem Proving
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
Jason Hickey, Aleksey Nogin