7015 search results - page 1059 / 1403 » Approximation algorithms for co-clustering |
179
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
242
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
169
click to vote
PVLDB
2010
15 years 5 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
159
click to vote
SIAMCO
2010
15 years 5 months ago
2010
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions...
208
click to vote
TCOM
2010
15 years 5 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....