13603 search results - page 116 / 2721 » On the Computational Complexity of Cut-Reduction |
183
Voted
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Videos usually consist of activities involving interactions between multiple actors, sometimes referred to as complex activities. Recognition of such activities requires modeling ...
133
click to vote
COCO
1989
Springer
15 years 10 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 ...
143
click to vote
LREC
2008
15 years 7 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 ...
120
click to vote
CORR
2006
Springer
15 years 6 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...
162
click to vote
TCS
2008
15 years 6 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...