Output details
11 - Computer Science and Informatics
University of Birmingham
Return to search
Output 0 of 0 in the submission
Output title
Computing with Abstract Matrix Structures
Type
E - Conference contribution
Name of conference/published proceedings
Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC2009)
Volume number
-
Issue number
-
First page of article
325
ISSN of proceedings
-
Year of publication
2009
URL
-
Number of additional authors
2
Additional information
<12>This is the first computational approach to deal with matrices that are composed of abstract, symbolic regions, that is regions that are of variable size and contain elided elements. While previously researchers have attempted this topic only solutions for very restricted cases had been found (such as triangular matrices). This is the first time a working calculus has been devised that can deal with combinations of regions which are arbitrary convex polynomials, while handling all constraints on spatial relationships between these regions under addition and multiplication. The work has since been employed in handwriting and sketch based interfaces.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Artificial Intelligence and Intelligent Robotics
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
