15033 search results - page 25 / 3007 » Complexity Theory and Algorithms |
142
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
130
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
145
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
121
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
116
click to vote
NETGAMES
2006
ACM
15 years 9 months ago
2006
ACM
— A practical pricing mechanism is the foundation for the deploying of IP multicast in the inter-domain Internet. The IP multicast service model and its pricing mechanism are dis...