Publications
Export 7151 results:
Author [ Title] Type Year Filters: Some-history-conjugate-gradient-and-lanczos-algorithms-1948%E2%80%931976 is [Clear All Filters]
2009. Aggregate Query Answering under Uncertain Schema Mappings. Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on. :940-951.
2007. Aggregates in Generalized Temporally Indeterminate Databases. Scalable Uncertainty ManagementScalable Uncertainty Management. 4772:171-186.
2007. Agile Quality Assurance Techniques for GUI-Based Applications. Agile software development quality assuranceAgile software development quality assurance. :114-114.
2008. An AGM-based belief revision mechanism for probabilistic spatio-temporal logics. Proceedings of the 23rd national conference on Artificial intelligence. :511-516.
2010. AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead. AI Magazine. 31(3):103-114.
2003. Airborne Video Registration for Activity Monitoring. Video RegistrationVideo Registration. 5:130-143.
1991. An algebra and calculus for relational multidatabase systems. , First International Workshop on Interoperability in Multidatabase Systems, 1991. IMS '91. Proceedings. :118-124.
1995. Algebraic Analysis of the Hierarchical Basis Preconditioner. SIAM Journal on Matrix Analysis and ApplicationsSIAM. J. Matrix Anal. & Appl.. 16(1):192-192.
2005. An algebraic approach to surface reconstruction from gradient fields. Computer Vision, 2005. ICCV 2005. Tenth IEEE International Conference on. 1:174-181Vol.1-174-181Vol.1.
2005. An Algebraic Theory Of Boundary Crossing Transitions. Electronic Notes in Theoretical Computer Science. 115:69-88.
1996. An algebraic theory of process efficiency. , Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS '96. Proceedings. :63-72.
1981. Algorithm 572: Solution of the Helmholtz Equation for the Dirichlet Problem on General Bounded Three-Dimensional Regions [D3]. ACM Transactions on Mathematical Software. 7(2):239-246.
1997. Algorithm 776: SRRIT: a Fortran subroutine to calculate the dominant invariant subspace of a nonsymmetric matrix. ACM Trans. Math. Softw.. 23(4):494-513.
2000. Algorithm 805: computation and uses of the semidiscrete matrix decomposition. ACM Trans. Math. Softw.. 26(3):415-435.
2005. Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices. ACM Transactions on Mathematical Software-TOMS. 31(2):252-269.
2008. Algorithm 879: EIGENTEST—a test matrix generator for large-scale eigenproblems. ACM Trans. Math. Softw.. 35(1):7:1–7:11-7:1–7:11.