128 search results - page 17 / 26 » Applying IC-Scheduling Theory to Familiar Classes of Computa... |
CSL
2005
Springer
14 years 28 days ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
ARITH
2003
IEEE
14 years 21 days ago
2003
IEEE
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
VLSM
2005
Springer
14 years 26 days ago
2005
Springer
We develop a fast numerical method to approximate the solutions of a wide class of equations associated to the Shape From Shading problem. Our method, which is based on the control...
CADE
1998
Springer
13 years 11 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
SUTC
2010
IEEE
13 years 11 months ago
2010
IEEE
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...