Sciweavers

286 search results - page 43 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
ICDM
2008
IEEE
109views Data Mining» more  ICDM 2008»
15 years 3 months ago
Learning by Propagability
In this paper, we present a novel feature extraction framework, called learning by propagability. The whole learning process is driven by the philosophy that the data labels and o...
Bingbing Ni, Shuicheng Yan, Ashraf A. Kassim, Loon...
72
Voted
WG
1995
Springer
15 years 1 months ago
On Interval Routing Schemes and Treewidth
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. T...
MM
2010
ACM
174views Multimedia» more  MM 2010»
14 years 9 months ago
Image classification using the web graph
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
Dhruv Kumar Mahajan, Malcolm Slaney
IMAMS
2003
125views Mathematics» more  IMAMS 2003»
14 years 10 months ago
A Graph-Spectral Method for Surface Height Recovery
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
Antonio Robles-Kelly, Edwin R. Hancock
116
Voted
TSMC
2010
14 years 4 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer