74 search results - page 10 / 15 » Combination Can Be Hard: Approximability of the Unique Cover... |
136
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
102
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
105
click to vote
WKDD
2010
CPS
15 years 5 months ago
2010
CPS
—Recommender systems apply machine learning techniques for filtering unseen information and can predict whether a user would like a given resource. There are three main types of...
102
click to vote
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...