1172 search results - page 149 / 235 » Path Algorithms on Regular Graphs |
122
click to vote
PKDD
2010
Springer
15 years 28 days ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
164
click to vote
AI
2011
Springer
14 years 9 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
133
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
107
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
94
Voted
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...