Sciweavers

156 search results - page 28 / 32
» Edge ranking of weighted trees
Sort
View
ICCV
2007
IEEE
14 years 5 months ago
Contextual Distance for Data Perception
Structural perception of data plays a fundamental role in pattern analysis and machine learning. In this paper, we develop a new structural perception of data based on local conte...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
COMPGEOM
2010
ACM
14 years 3 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
CVPR
2011
IEEE
13 years 7 months ago
From Partial Shape Matching through Local Deformation to Robust Global Shape Similarity for Object Detection
In this paper, we propose a novel framework for contour based object detection. Compared to previous work, our contribution is three-fold. 1) A novel shape matching scheme suitabl...
Tianyang Ma, LonginJan Latecki
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 2 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
STACS
2001
Springer
14 years 3 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid