394 search results - page 38 / 79 » Computing Minimal Polynomials of Matrices |
101
Voted
CVPR
1997
IEEE
15 years 4 months ago
1997
IEEE
We describe a linear algorithm to recover 30 afJine slzape/niotionfrom line correspondences over three views with uncalibrated afine cameras. The key idea is the introduction of a...
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
81
Voted
STOC
2002
ACM
16 years 24 days ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
129
Voted
ECCC
2006
15 years 16 days ago
2006
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
92
Voted
ANOR
2002
15 years 12 days ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...