28888 search results - page 119 / 5778 » Computability and complexity in analysis |
COLING
1996
13 years 9 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
FGCS
2007
13 years 8 months ago
2007
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
APAL
2011
13 years 3 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...
DEXA
2004
Springer
14 years 1 months ago
2004
Springer
Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definit...
ANTS
1994
Springer
14 years 5 days ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...