1523 search results - page 67 / 305 » The Computational Complexity of Linear Optics |
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
WG
1998
Springer
14 years 1 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
ICCV
2001
IEEE
14 years 10 months ago
2001
IEEE
We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates ...