1480 search results - page 173 / 296 » Distributed algorithms for weighted problems in sparse graph... |
99
Voted
UAI
1996
15 years 2 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
133
Voted
CVPR
2001
IEEE
16 years 2 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
121
Voted
SAGT
2010
Springer
14 years 11 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
97
Voted
DCOSS
2008
Springer
15 years 2 months ago
2008
Springer
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
78
Voted
APIN
2010
15 years 26 days ago
2010
The original Parameter-Less Self-Organising Map (PLSOM) algorithm was introduced as a solution to the problems the Self-Organising Map (SOM) encounters when dealing with certain ty...