1480 search results - page 216 / 296 » Distributed algorithms for weighted problems in sparse graph... |
111
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
In thispaper, the problem ofsimultaneousmotionestimation of multiple independently moving objects is addressed. A novel Bayesian approach is designedfor solvingthisproblem using t...
117
click to vote
SBACPAD
2003
IEEE
15 years 8 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
136
click to vote
PODS
2008
ACM
16 years 3 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
134
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
123
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...