14774 search results - page 75 / 2955 » Computational complexity and evolutionary computation |
114
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
216
click to vote
APAL
2011
14 years 10 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
131
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...
135
Voted
GRAMMARS
2002
15 years 3 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
CIE
2008
Springer
15 years 5 months ago
2008
Springer
