1161 search results - page 218 / 233 » Approximation schemes for clustering problems |
137
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
131
Voted
EOR
2010
15 years 1 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
130
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
115
Voted
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
106
Voted
TCSV
2002
15 years 1 months ago
2002
Unified video-on-demand (UVoD) is a recently proposed architecture that integrates multicast transmission with unicast transmission to improve system efficiency. Streaming channels...