Sciweavers

1480 search results - page 91 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
MICAI
2007
Springer
14 years 4 months ago
Fuzzifying Clustering Algorithms: The Case Study of MajorClust
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
Eugene Levner, David Pinto, Paolo Rosso, David Alc...
INFOCOM
2008
IEEE
14 years 5 months ago
Light-Weight Contour Tracking in Wireless Sensor Networks
Abstract—We study the problem of contour tracking with binary sensors, an important problem for monitoring spatial signals and tracking group targets. In particular, we track the...
Xianjin Zhu, Rik Sarkar, Jie Gao, Joseph S. B. Mit...
MST
2010
187views more  MST 2010»
13 years 5 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
SOFSEM
2007
Springer
14 years 4 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...
ICIW
2009
IEEE
14 years 5 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...