394 search results - page 46 / 79 » Computing Minimal Polynomials of Matrices |
CVPR
1999
IEEE
16 years 2 months ago
1999
IEEE
This paper introduces an extension of Hartley's selfcalibration technique [8] based on properties of the essential matrix, allowing for the stable computation of varying foca...
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
CORR
2007
Springer
15 years 14 days ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
111
Voted
MST
2010
14 years 7 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
101
Voted
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...