Sciweavers

1282 search results - page 132 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
100
Voted
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 2 months ago
Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...
Ariel Daliot, Danny Dolev, Hanna Parnas
147
Voted
ICA
2007
Springer
15 years 8 months ago
Morphological Diversity and Sparsity in Blind Source Separation
This paper describes a new blind source separation method for instantaneous linear mixtures. This new method coined GMCA (Generalized Morphological Component Analysis) relies on mo...
Jérôme Bobin, Yassir Moudden, Jalal F...
ADHOCNOW
2004
Springer
15 years 8 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
SEMWEB
2010
Springer
15 years 12 days ago
Finding the Achilles Heel of the Web of Data: Using Network Analysis for Link-Recommendation
Abstract. The Web of Data is increasingly becoming an important infrastructure for such diverse sectors as entertainment, government, ecommerce and science. As a result, the robust...
Christophe Guéret, Paul T. Groth, Frank van...
AI
2011
Springer
14 years 9 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...