Sciweavers

1664 search results - page 66 / 333
» Distance labeling in graphs
Sort
View
SDM
2009
SIAM
117views Data Mining» more  SDM 2009»
15 years 9 months ago
Spatially Cost-Sensitive Active Learning.
In active learning, one attempts to maximize classifier performance for a given number of labeled training points by allowing the active learning algorithm to choose which points...
Alexander Liu, Goo Jun, Joydeep Ghosh
WEBI
2001
Springer
15 years 4 months ago
Average-Clicks: A New Measure of Distance on the World Wide Web
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, ...
Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka
ICPR
2008
IEEE
15 years 6 months ago
An improvement on learning with local and global consistency
A modified version for semi-supervised learning algorithm with local and global consistency was proposed in this paper. The new method adds the label information, and adopts the g...
Jie Gui, De-Shuang Huang, Zhuhong You
IWPEC
2009
Springer
15 years 6 months ago
An Exponential Time 2-Approximation Algorithm for Bandwidth
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
Martin Fürer, Serge Gaspers, Shiva Prasad Kas...
SCALESPACE
2005
Springer
15 years 5 months ago
Discrete Representation of Top Points via Scale Space Tessellation
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
Bram Platel, M. Fatih Demirci, Ali Shokoufandeh, L...