17770 search results - page 198 / 3554 » A Generalization of Forward-Backward Algorithm |
211
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
164
click to vote
UIST
2010
ACM
15 years 4 months ago
2010
ACM
Mechanical Turk provides an on-demand source of human computation. This provides a tremendous opportunity to explore algorithms which incorporate human computation as a function c...
175
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
206
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
241
click to vote
CSCW
2012
ACM
14 years 2 months ago
2012
ACM
Users have come to rely on automated route finding services for driving, public transit, walking, and bicycling. Current state of the art route finding algorithms typically rely...