2466 search results - page 318 / 494 » Algorithms for distributed functional monitoring |
127
click to vote
COCO
2008
Springer
15 years 2 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
118
click to vote
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
Object segmentation needs to be driven by top-down knowledge to produce semantically meaningful results. In this paper, we propose a supervised segmentation approach that tightly ...
104
Voted
ICFP
1999
ACM
15 years 5 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
116
Voted
SIGECOM
2008
ACM
15 years 22 days ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
104
click to vote
PODC
2003
ACM
15 years 6 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...