1204 search results - page 231 / 241 » Termination of Polynomial Programs |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
DFG
2009
Springer
14 years 3 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
BIBM
2008
IEEE
14 years 3 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...