7015 search results - page 87 / 1403 » Approximation algorithms for co-clustering |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
DAM
2000
13 years 9 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—Abstract—In recent years, numerous large-scale Wireless LANs (WLAN) have been deployed all over the world. However, the shortage of non-interfering channels makes it a challen...