Sciweavers

19320 search results - page 3 / 3864
» On the complexity of computing determinants
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
High-throughput protein structure determination using grid computing
Determining the X-ray crystallographic structures of proteins using the technique of molecular replacement (MR) can be a time and labor-intensive trial-and-error process, involvin...
Jason W. Schmidberger, Blair Bethwaite, Colin Enti...
ICAC
2009
IEEE
14 years 4 months ago
Ranking the importance of alerts for problem determination in large computer systems
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
Guofei Jiang, Haifeng Chen, Kenji Yoshihira, Akhil...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 7 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
MFCS
2007
Springer
14 years 3 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
CVPR
1999
IEEE
14 years 11 months ago
An Efficient Recursive Factorization Method for Determining Structure from Motion
A recursive method is presented for recovering 3D object shape and camera motion under orthography from an extended sequence of video images. This may be viewed as a natural exten...
Yanhua Li, Michael J. Brooks