1664 search results - page 136 / 333 » Distance labeling in graphs |
165
click to vote
SCALESPACE
2009
Springer
15 years 9 months ago
2009
Springer
We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentati...
149
click to vote
FCT
1993
Springer
15 years 8 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
129
click to vote
ER
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
134
click to vote
COCO
2001
Springer
15 years 9 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
150
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....