4539 search results - page 91 / 908 » Approaches to Compute Workflow Complexity |
ASAP
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a digit-recurrence algorithm for division in real and complex number domains using a variable radix. The objective of the approach is to simplify the prescaling of the ...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
ICCV
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
170
click to vote
CVPR
1998
IEEE
15 years 11 months ago
1998
IEEE
New representations are developed for 2D IP (implicit polynomial) curves ofarbitrary degree. These representations permit shape recognition and pose estimation with essentially sin...
STACS
2007
Springer
15 years 4 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...