16666 search results - page 431 / 3334 » Descriptive and Computational Complexity |
157
click to vote
ASAP
2005
IEEE
16 years 16 days 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 ...
191
click to vote
COMPGEOM
2003
ACM
16 years 4 days ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
145
click to vote
COCO
1989
Springer
15 years 11 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
160
click to vote
LREC
2008
15 years 8 months ago
2008
We present a corpus of spoken dialogues between students and an adaptive Wizard-of-Oz tutoring system, in which student uncertainty was manually annotated in real-time. We detail ...
132
click to vote
CORR
2006
Springer
15 years 7 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...