Sciweavers

1523 search results - page 6 / 305
» The Computational Complexity of Linear Optics
Sort
View
IJCV
2000
230views more  IJCV 2000»
13 years 7 months ago
Design and Use of Linear Models for Image Motion Analysis
Linear parameterized models of optical flow, particularly affine models, have become widespread in image motion analysis. The linear model coefficients are straightforward to estim...
David J. Fleet, Michael J. Black, Yaser Yacoob, Al...
IPPS
1999
IEEE
13 years 11 months ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...
IEEECGIV
2009
IEEE
14 years 2 months ago
Thai Font Type Recognition Using Linear Interpolation Analysis
A new approach to Thai font type recognition that is presented in this paper is based on linear interpolation analysis of the character contour. The algorithm can perform effectiv...
Pitchaya Jamjuntr, Natasha Dejdumrong
ICCSA
2003
Springer
14 years 21 days ago
Camera Models and Optical Systems Used in Computer Graphics: Part II, Image-Based Techniques
Abstract. In our companion paper [5], we described the optics underlying camera models that have been used in computer graphics, and presented object space techniques for rendering...
Brian A. Barsky, Daniel R. Horn, Stanley A. Klein,...
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
13 years 11 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert