41 search results - page 4 / 9 » Conditional hardness for satisfiable 3-CSPs |
TIP
2010
14 years 4 months ago
2010
Much research has been devoted to the problem of restoring Poissonian images, namely for medical and astronomical applications. However, the restoration of these images using state...
IANDC
2008
14 years 9 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
BMCBI
2008
14 years 9 months ago
2008
Background: We consider effects of dependence among variables of high-dimensional data in multiple hypothesis testing problems, in particular the False Discovery Rate (FDR) contro...
104
click to vote
SENSYS
2010
ACM
14 years 7 months ago
2010
ACM
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
CORR
2010
Springer
14 years 9 months 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...