Sciweavers

8669 search results - page 152 / 1734
» Computing matrix representations
Sort
View
IJFCS
2006
70views more  IJFCS 2006»
13 years 9 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
14 years 1 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan
ICIP
2008
IEEE
14 years 3 months ago
Globally optimal solution to exploit rigidity when recovering structure from motion under occlusion
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...
Pedro M. Q. Aguiar, João M. F. Xavier, Mark...
ISVC
2009
Springer
14 years 1 months ago
Visualization of the Molecular Dynamics of Polymers and Carbon Nanotubes
Abstract. Research domains that deal with complex molecular systems often employ computer-based thermodynamics simulations to study molecular interactions and investigate phenomena...
Sidharth Thakur, Syamal Tallury, Melissa A. Pasqui...
ICCV
2011
IEEE
12 years 9 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis