1480 search results - page 134 / 296 » Distributed algorithms for weighted problems in sparse graph... |
105
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
91
Voted
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
101
Voted
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— Making inferences and choosing appropriate responses based on incomplete, uncertainty and noisy data is challenging in financial settings particularly in bankruptcy de...
98
Voted
JSAC
2008
15 years 17 days ago
2008
A distributed estimation algorithm for sensor networks is proposed. A noisy time-varying signal is jointly tracked by a network of sensor nodes, in which each node computes its es...
118
Voted
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...