2698 search results - page 179 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
189
click to vote
CORR
2011
Springer
15 years 1 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...
185
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
168
click to vote
PODC
2005
ACM
16 years 1 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
172
click to vote
CPM
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
324
click to vote
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...