Sciweavers

974 search results - page 177 / 195
» pairing 2010
Sort
View
CLOUD
2010
ACM
16 years 15 days ago
G-Store: a scalable data store for transactional multi key access in the cloud
Cloud computing has emerged as a preferred platform for deploying scalable web-applications. With the growing scale of these applications and the data associated with them, scalab...
Sudipto Das, Divyakant Agrawal, Amr El Abbadi
180
Voted
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
16 years 8 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
190
Voted
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
16 years 7 days ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
16 years 7 days ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
198
Voted
SPAA
2010
ACM
16 years 7 days ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...