1933 search results - page 96 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
179
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
130
Voted
FLAIRS
2006
15 years 5 months ago
2006
The world wide web has a wealth of information that is related to almost any text classification task. This paper presents a method for mining the web to improve text classificati...
112
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
123
Voted
CIDM
2009
IEEE
15 years 10 months ago
2009
IEEE
— Many real-world applications have problems when learning from imbalanced data sets, such as medical diagnosis, fraud detection, and text classification. Very few minority clas...
139
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...