604 search results - page 89 / 121 » On the Complexity of the Maximum Cut Problem |
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
75
Voted
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
This report addresses the problem of scheduling for real-time systems that include both hard and soft tasks. In order to capture the relative importance of soft tasks and how the ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
67
Voted
RECOMB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
TMC
2002
14 years 9 months ago
2002
This paper proposes a scheme of optimal resource management for reverse-link transmissions in multimedia wideband code-division multiple-access (WCDMA) communications. It is to gua...