7796 search results - page 356 / 1560 » On Generalized Schur Numbers |
169
Voted
SPAA
2006
ACM
16 years 24 days ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
176
click to vote
WAOA
2005
Springer
16 years 10 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
219
Voted
IPPS
2003
IEEE
16 years 4 days ago
2003
IEEE
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
169
Voted
PODS
2010
ACM
15 years 12 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
177
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...