3894 search results - page 529 / 779 » Approximation Algorithms for Biclustering Problems |
150
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
138
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
187
click to vote
SIROCCO
1997
15 years 5 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
131
click to vote
PVLDB
2010
15 years 2 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 ...
155
click to vote
TCOM
2010
15 years 2 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....