2957 search results - page 254 / 592 » The Complexity of Polynomial-Time Approximation |
170
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
147
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
170
click to vote
CCCG
2010
15 years 8 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
191
click to vote
DEXA
2010
Springer
15 years 7 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
156
click to vote
IJAR
2008
15 years 6 months ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...