Sciweavers

2079 search results - page 291 / 416
» Universality of random graphs
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...
ICDT
2010
ACM
211views Database» more  ICDT 2010»
16 years 1 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
ARSCOM
2007
63views more  ARSCOM 2007»
15 years 4 months ago
Towards a Characterisation of Lottery Set Overlapping Structures
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
Alewyn P. Burger, W. R. Grundlingh, Jan H. van Vuu...
IOR
2007
65views more  IOR 2007»
15 years 4 months ago
A Comparison of the Optimal Costs of Two Canonical Inventory Systems
We compare two inventory systems, one in which excess demand is lost and the other in which excess demand is backordered. Both systems are reviewed periodically. They experience t...
Ganesh Janakiraman, Sridhar Seshadri, J. George Sh...
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 8 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo