2168 search results - page 342 / 434 » Randomized Algorithms and Complexity Theory |
129
click to vote
WWW
2008
ACM
16 years 3 months ago
2008
ACM
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
133
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
123
click to vote
AAAI
2006
15 years 4 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
263
click to vote
SIGECOM
2011
ACM
14 years 6 months ago
2011
ACM
Market making refers broadly to trading strategies that seek to profit by providing liquidity to other traders, while avoiding accumulating a large net position in a stock. In th...
144
click to vote
ISCA
2005
IEEE
15 years 8 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...