14548 search results - page 2747 / 2910 » The Optimal Path-Matching Problem |
162
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper answers a question raised by Doyle on the relevance of the Witsenhausen counterexample as a toy decentralized control problem. The question has two sides, the first of w...
162
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information ...
188
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: Applications such as Face Recognition (FR) that deal with high-dimensional data need a mapping technique that introduces representation of low-dimensional features with enhanced ...
181
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 years 6 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...