14699 search results - page 103 / 2940 » Complexity and Cognitive Computing |
IPL
2006
13 years 10 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
FUN
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
ICRA
2005
IEEE
14 years 4 months ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...