258 search results - page 38 / 52 » Weak Bisimulation Approximants |
104
click to vote
LATIN
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
TON
2008
14 years 9 months ago
2008
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
SIAMNUM
2010
14 years 4 months ago
2010
Abstract. In this article a stochastic particle system approximation to the parametric sensitivity in the Smoluchowski coagulation equation is introduced. The parametric sensitivit...
101
click to vote
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
Bottom-up, fully unsupervised segmentation remains a daunting challenge for computer vision. In the cosegmentation context, on the other hand, the availability of multiple images ...