796 search results - page 107 / 160 » Approximating the centroid is hard |
MFCS
2005
Springer
14 years 1 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...
UC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
ISMIR
2004
Springer
14 years 1 months ago
2004
Springer
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
LATIN
2010
Springer
14 years 24 days ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
CDC
2009
IEEE
14 years 12 days ago
2009
IEEE
Abstract— Power dissipation has constrained the performance boosting of modern computer systems in the past decade. Dynamic power management (DPM) has been implemented in many sy...