633 search results - page 44 / 127 » Locality and Hard SAT-Instances |
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
This paper deals with clustering of spatially distributed data using wireless sensor networks. A distributed low-complexity clustering algorithm is developed that requires one-hop...
DATAMINE
2010
13 years 10 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
MFCS
2010
Springer
13 years 8 months ago
2010
Springer
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
MST
2010
13 years 4 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
STOC
2012
ACM
12 years 9 days ago
2012
ACM
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...