549 search results - page 104 / 110 » On the Complexity of Restricted k-anonymity Problem |
CLIMA
2007
14 years 11 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
DAGM
2010
Springer
14 years 11 months ago
2010
Springer
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
AML
2008
14 years 10 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
JCSS
2000
14 years 9 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...