2698 search results - page 312 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
201
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
182
click to vote
WAOA
2004
Springer
15 years 12 months ago
2004
Springer
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
175
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
129
click to vote
NIPS
2003
15 years 8 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
156
click to vote
AAAI
2007
15 years 9 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...