3894 search results - page 606 / 779 » Approximation Algorithms for Biclustering Problems |
154
Voted
PR
2008
15 years 3 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
114
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
122
Voted
MOBIHOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
130
Voted
INFOCOM
2008
IEEE
15 years 10 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...
133
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...