2957 search results - page 590 / 592 » The Complexity of Polynomial-Time Approximation |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
ALDT
2011
Springer
12 years 7 months ago
2011
Springer
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...
IACR
2011
12 years 7 months ago
2011
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...