Sciweavers

1664 search results - page 86 / 333
» Distance labeling in graphs
Sort
View
136
Voted
DAGM
2004
Springer
15 years 9 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
ECCV
2010
Springer
15 years 9 months ago
Enhancing Interactive Image Segmentation with Automatic Label Set Augmentation
Abstract. We address the problem of having insufficient labels in an interactive image segmentation framework, for which most current methods would fail without further user inter...
142
Voted
SIGIR
2010
ACM
15 years 8 months ago
Exploring the use of labels to shortcut search trails
Search trails comprising queries and Web page views are created as searchers engage in information-seeking activity online. During known-item search (where the objective may be to...
Ryen W. White, Raman Chandrasekar
CPM
2006
Springer
143views Combinatorics» more  CPM 2006»
15 years 7 months ago
Algorithms for Finding a Most Similar Subforest
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
Jesper Jansson, Zeshan Peng
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 10 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan