17760 search results - page 378 / 3552 » A Generalization of the Massey-Ding Algorithm |
207
click to vote
TNN
2008
15 years 7 months ago
2008
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
187
Voted
JMM2
2007
15 years 7 months ago
2007
—Optical flow algorithms are difficult to apply to robotic vision applications in practice because of their extremely high computational and frame rate requirements. In most case...
200
click to vote
UIST
2010
ACM
15 years 5 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...
197
click to vote
CORR
2011
Springer
15 years 2 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...
228
click to vote
SAC
2011
ACM
14 years 10 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 ...