19320 search results - page 106 / 3864 » On the complexity of computing determinants |
117
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
135
click to vote
CVPR
2003
IEEE
16 years 6 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...
145
click to vote
GRAMMARS
2002
15 years 4 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...
131
click to vote
EUROGP
2001
Springer
15 years 9 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
156
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...