Sciweavers

1584 search results - page 232 / 317
» Making priors a priority
Sort
View
PODC
2005
ACM
16 years 5 days ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
194
Voted
SASN
2005
ACM
16 years 5 days ago
Key distribution and update for secure inter-group multicast communication
Group communication has become an important component in wireless networks. In this paper, we focus on the environments in which multiple groups coexist in the system, and both in...
Weichao Wang, Bharat K. Bhargava
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
16 years 5 days ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
16 years 5 days ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...
SIGIR
2005
ACM
16 years 5 days ago
The maximum entropy method for analyzing retrieval measures
We present a model, based on the maximum entropy method, for analyzing various measures of retrieval performance such as average precision, R-precision, and precision-at-cutoffs....
Javed A. Aslam, Emine Yilmaz, Virgiliu Pavlu