683 search results - page 84 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
171
Voted
JMLR
2008
15 years 3 months ago
2008
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
117
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
116
Voted
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
126
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
123
Voted
WDAG
2010
Springer
15 years 2 months ago
2010
Springer
We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric ...