1933 search results - page 125 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
115
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
131
click to vote
CIAC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
126
click to vote
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
– Integration of beamforming to sensors is very beneficial for a reduction of transmission power consumption and for improvement of the overall system performance. Unfortunately,...
167
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
146
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
Training datasets for learning of object categories are often contaminated or imperfect. We explore an approach to automatically identify examples that are noisy or troublesome fo...