12183 search results - page 261 / 2437 » Computers under Attacks! |
180
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
183
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
153
click to vote
JUCS
2010
15 years 5 months ago
2010
: Decision making under uncertainty is a key issue in information fusion and logic based reasoning approaches. The aim of this paper is to show noteworthy theoretical and applicati...
223
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
299
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing alg...