1941 search results - page 93 / 389 » On the Hardness of Approximate Reasoning |
CORR
2010
Springer
15 years 4 hour ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
105
click to vote
MST
2007
14 years 11 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
110
click to vote
DLOG
2007
15 years 2 months ago
2007
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
109
click to vote
KDD
2009
ACM
16 years 13 days ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
177
click to vote
SIGMOD
2007
ACM
16 years 1 days ago
2007
ACM
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...