264 search results - page 36 / 53 » On the possibility of faster SAT algorithms |
136
click to vote
IROS
2007
IEEE
16 years 14 days ago
2007
IEEE
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
161
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
191
click to vote
JMLR
2006
15 years 6 months ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
163
click to vote
JCSS
2010
15 years 4 months ago
2010
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
173
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...