478 search results - page 90 / 96 » Approximation algorithms for general packing problems and th... |
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
ECCC
2010
13 years 9 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
WSDM
2012
ACM
12 years 4 months ago
2012
ACM
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...