2957 search results - page 338 / 592 » The Complexity of Polynomial-Time Approximation |
155
click to vote
AAAI
1994
15 years 8 months ago
1994
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
183
click to vote
MST
2006
15 years 6 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
177
click to vote
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
191
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
435
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...