1162 search results - page 26 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
130
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
120
Voted
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
148
Voted
TIP
2008
15 years 3 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
141
Voted
ICMLA
2004
15 years 5 months ago
2004
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...
138
click to vote
SSPR
1998
Springer
15 years 8 months ago
1998
Springer
A novel method to improve the generalization performance of the Minimum Classification Error (MCE) / Generalized Probabilistic Descent (GPD) learning is proposed. The MCE/GPD learn...