Sciweavers

5019 search results - page 220 / 1004
» Computing in Quotient Groups
Sort
View
DCC
2005
IEEE
16 years 6 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
IROS
2007
IEEE
137views Robotics» more  IROS 2007»
16 years 27 days ago
Energy-based 6-DOF penetration depth computation for penalty-based haptic rendering algorithms
Abstract— Existing penalty-based haptic rendering approaches compute penetration depth in strictly translational sense and cannot properly take object rotation into account. We a...
Maxim Kolesnikov, Milos Zefran
PARA
1994
Springer
15 years 10 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal
APNOMS
2006
Springer
15 years 10 months ago
On the Security of Attribute Certificate Structuring for Highly Distributed Computing Environments
For an efficient role based access control using attribute certificate in highly distributed computing environments, we use a technique of structuring role specification certificat...
Soomi Yang
ENTER
2006
Springer
15 years 10 months ago
Attracting Visitors - Using Computer Games Technology to Build a VR-Museum
A cultural institution such as a museum needs to attract visitors. Due to the fact that Internet has become an important information and marketing channel, the question of using a...
Ingvar Tjøstheim, Joachim Lous