Sciweavers

27 search results - page 3 / 6
» Fast Parallel Computation of the Polynomial Shift
Sort
View
ICIP
2004
IEEE
14 years 6 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
SPDP
1993
IEEE
13 years 9 months ago
Fast Rehashing in PRAM Emulations
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
J. Keller
MICRO
2003
IEEE
148views Hardware» more  MICRO 2003»
13 years 10 months ago
Fast Secure Processor for Inhibiting Software Piracy and Tampering
Due to the widespread software piracy and virus attacks, significant efforts have been made to improve security for computer systems. For stand-alone computers, a key observation...
Jun Yang 0002, Youtao Zhang, Lan Gao
DCOSS
2009
Springer
13 years 12 months ago
Fast Self-stabilization for Gradients
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...
JCAM
2011
78views more  JCAM 2011»
12 years 8 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters