1964 search results - page 247 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
MST
2010
13 years 3 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...
IICS
2003
Springer
14 years 1 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
ICA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This paper deals with the problem of Blind Source Separation. Contrary to the vast majority of works, we do not assume the statistical independence between the sources an...
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
— In this paper, the problem of optimizing the performances of a distributed supply chain is faced by means of a decentralized architecture. In particular, a general scheme for a...
TIME
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...