1469 search results - page 292 / 294 » Approximate polynomial decomposition |
105
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
138
Voted
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
103
Voted
WINE
2010
Springer
14 years 11 months ago
2010
Springer
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...
151
click to vote
ALGOSENSORS
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
114
click to vote
WWW
2011
ACM
14 years 8 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...