1480 search results - page 156 / 296 » Distributed algorithms for weighted problems in sparse graph... |
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
CVPR
2000
IEEE
15 years 5 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
122
click to vote
BMCBI
2007
15 years 24 days ago
2007
Background: Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription fact...
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
131
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We propose a distributed implementation of the Gaussian particle filter (GPF) for use in a wireless sensor network. Each sensor runs a local GPF that computes a global state esti...