1933 search results - page 104 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
295
Voted
AAIM
2011
Springer
14 years 7 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
141
click to vote
SCALESPACE
2005
Springer
15 years 9 months ago
2005
Springer
Level-Set methods have been successfully applied to 2D and 3D boundary detection problems. The geodesic active contour model has been particularly successful. Several algorithms fo...
100
Voted
WEBI
2005
Springer
15 years 9 months ago
2005
Springer
Web page clustering is a technology that puts semantically related web pages into groups and is useful for categorizing, organizing, and refining search results. When clustering ...
146
Voted
KAIS
2010
15 years 2 months ago
2010
Real world data mining applications must address the issue of learning from imbalanced data sets. The problem occurs when the number of instances in one class greatly outnumbers t...
115
Voted
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...