19866 search results - page 220 / 3974 » Computing all factorizations in *** |
154
click to vote
APPML
2007
15 years 6 months ago
2007
We consider the computation of the Iwasawa decomposition of a symplectic matrix via the QR factorization. The algorithms presented improve on the method recently decribed in [8]. K...
161
click to vote
DM
2007
15 years 6 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
156
click to vote
GC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
144
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
158
click to vote
CASCON
1996
15 years 8 months ago
1996
Software development managers strive to control all of the factors that might impact the success of their projects. However, not all of these factors have been identified, much le...