#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1991

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve upper bounds on the exponent of matrix multiplication yielded by group-theoretic full matrix multiplication. The group… (More)

- J Feight, J Fischer, I Kadish, H G Orem, A Ridenour
- Journal of health care interior design…
- 1991

- Hendrik Orem
- 2008

Any physical system corresponding to a two-dimensional vector field has some uncertainty in the true flow at any given point; this uncertainty may even vary in time. Analytic study of a dynamical system often shows that a given point is in the basin of attraction of an asymptotically stable fixed point, but uncertainty in the vector field may change the… (More)

- S E Garrison, H G Orem, A Ridenour, G G Smith
- Journal of healthcare design : proceedings from…
- 1993

- H G Orem
- Journal of healthcare design : proceedings from…
- 1993

An improvement upon the naive O(n3) algorithm for matrix multiplication was first presented by Strassen, obtaining the result in only O(n2.81) field operations [5]. This raises the question of what the best possible exponent k such that matrix multiplication can be carried out in at most O(nk) time is. Clearly k ≥ 2, since n2 is the size of the output. It… (More)

- ‹
- 1
- ›