1067 search results - page 161 / 214 » Probabilistic regular graphs |
102
Voted
DGCI
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
108
Voted
AAIM
2008
Springer
15 years 2 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
NETWORKING
2008
15 years 1 months ago
2008
We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectivel...
114
click to vote
NIPS
2007
15 years 1 months ago
2007
Semi-supervised methods use unlabeled data in addition to labeled data to construct predictors. While existing semi-supervised methods have shown some promising empirical performa...
121
Voted
VMV
2008
15 years 1 months ago
2008
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...