15485 search results - page 2904 / 3097 » Computing Optimal Subsets |
121
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
150
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
108
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
252
Voted
OSDI
2008
ACM
16 years 2 months ago
2008
ACM
Efficiently managing storage is important for virtualized computing environments. Its importance is magnified by developments such as cloud computing which consolidate many thousa...
125
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...