736 search results - page 80 / 148 » Distinguishing geometric graphs |
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
118
click to vote
AAAI
2008
15 years 2 months ago
2008
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
111
click to vote
DAM
2000
14 years 11 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
92
Voted
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...