Sciweavers

242 search results - page 5 / 49
» Compact Fundamental Matrix Computation
Sort
View
ACCV
2009
Springer
15 years 4 months ago
Twisted Cubic: Degeneracy Degree and Relationship with General Degeneracy
Fundamental matrix, drawing geometric relationship between two images, plays an important role in 3-dimensional computer vision. Degenerate configurations of space points and two ...
Tian Lan, Yihong Wu, Zhanyi Hu
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
14 years 4 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
ICCV
2011
IEEE
13 years 9 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
15 years 6 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...
LCTRTS
2001
Springer
15 years 2 months ago
Combining Global Code and Data Compaction
Computers are increasingly being incorporated in devices with a limited amount of available memory. As a result research is increasingly focusing on the automated reduction of pro...
Bjorn De Sutter, Bruno De Bus, Koenraad De Bossche...