We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
—We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow ...
—Network calculus is a recently developed theory dealing with queuing systems found in computer networks with focus on service guarantee analysis. In the current network calculus...
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...