334 search results - page 8 / 67 » Improved Algorithms and Complexity Results for Power Dominat... |
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
CC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
BMCBI
2010
2010
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
13 years 7 months ago
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper introduces a resource allocation strategy which focuses on minimizing power consumption in Orthogonal Frequency Division Multiplexing(OFDM) systems. In case of multi...