394 search results - page 36 / 79 » Computing Minimal Polynomials of Matrices |
89
Voted
ECCV
1994
Springer
16 years 2 months ago
1994
Springer
We show how a special decomposition of a set of two or three general projection matrices, called canonic enables us to build geometric descriptions for a system of cameras which a...
102
Voted
SMA
2003
ACM
15 years 5 months ago
2003
ACM
In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to...
105
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
119
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
103
click to vote
MOBIHOC
2002
ACM
16 years 3 days ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...