20745 search results - page 3889 / 4149 » Computer graphics for all |
144
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
136
Voted
STOC
2004
ACM
16 years 4 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...
146
Voted
STOC
2002
ACM
16 years 4 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
138
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
133
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....