Sciweavers

328 search results - page 29 / 66
» Algorithms for the edge-width of an embedded graph
Sort
View
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
15 years 6 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt
ICMS
2010
14 years 10 months ago
TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
Jan Reininghaus, David Günther, Ingrid Hotz, ...
ICIP
2008
IEEE
15 years 6 months ago
Correlation Embedding Analysis
—Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms usi...
Yun Fu, Thomas S. Huang
CVPR
2010
IEEE
15 years 7 months ago
Dense Non-rigid Surface Registration Using High-Order Graph Matching
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Di...
AVSS
2009
IEEE
14 years 9 months ago
Landmark Localisation in 3D Face Data
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
Marcelo Romero, Nick Pears