Sciweavers

167 search results - page 11 / 34
» Constraints for closest point finding
Sort
View
IJAIT
2008
99views more  IJAIT 2008»
13 years 8 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
IPMI
2005
Springer
14 years 1 months ago
Transitive Inverse-Consistent Manifold Registration
Abstract. This paper presents a new registration method called Transitive InverseConsistent Manifold Registration (TICMR). The TICMR method jointly estimates correspondence maps be...
Xiujuan Geng, Dinesh Kumar, Gary E. Christensen
IJCV
2006
94views more  IJCV 2006»
13 years 8 months ago
Four Points in Two or Three Calibrated Views: Theory and Practice
Suppose two perspective views of four world points are given and that the intrinsic parameters are known but the camera poses and the world point positions are not. We prove that t...
David Nistér, Frederik Schaffalitzky
EGH
2004
Springer
13 years 11 months ago
Understanding the efficiency of GPU algorithms for matrix-matrix multiplication
Utilizing graphics hardware for general purpose numerical computations has become a topic of considerable interest. The implementation of streaming algorithms, typified by highly ...
Kayvon Fatahalian, Jeremy Sugerman, Pat Hanrahan
BMVC
2002
13 years 10 months ago
Invariant Features from Interest Point Groups
This paper approaches the problem of finding correspondences between images in which there are large changes in viewpoint, scale and illumination. Recent work has shown that scale...
Matthew Brown, David G. Lowe