2252 search results - page 315 / 451 » Lower Bounds for Dynamic Algorithms |
139
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
150
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
123
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
148
Voted
DAGSTUHL
2006
15 years 4 months ago
2006
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...
119
click to vote
SODA
2010
ACM
16 years 25 days ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...