290 search results - page 31 / 58 » Local Partitioning for Directed Graphs Using PageRank |
148
click to vote
PAMI
2010
15 years 26 days ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
129
click to vote
TVCG
2012
13 years 4 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
127
click to vote
AAAI
2010
15 years 3 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
141
click to vote
MLDM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
135
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....