Sciweavers

113 search results - page 21 / 23
» Fast algorithms for discrete polynomial transforms
Sort
View
CPHYSICS
2006
103views more  CPHYSICS 2006»
13 years 8 months ago
WATERWAVES: wave particles dynamics on a complex triatomic potential
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
Simone Taioli, Jonathan Tennyson
CVPR
2010
IEEE
14 years 4 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 3 months ago
The power and Arnoldi methods in an algebra of circulants
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
David F. Gleich, Chen Greif, James M. Varah
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 20 days ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
ICIP
2003
IEEE
14 years 10 months ago
Matching pursuits based multiple description video coding for lossy environments
Multiple description coding (MDC) is an error resilient source coding scheme that creates multiple descriptions of the source with the aim of providing an acceptable reconstructio...
Thinh P. Q. Nguyen, Avideh Zakhor