2957 search results - page 288 / 592 » The Complexity of Polynomial-Time Approximation |
165
click to vote
CAIP
2007
Springer
15 years 10 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
169
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex...
142
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
171
Voted
IPL
2008
15 years 6 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
187
click to vote
PVLDB
2010
15 years 5 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...