798 search results - page 65 / 160 » Engineering graph clustering: Models and experimental evalua... |
141
click to vote
ICCV
2005
IEEE
16 years 7 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
151
click to vote
KIVS
2005
Springer
15 years 11 months ago
2005
Springer
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
151
click to vote
ASPDAC
2006
ACM
15 years 11 months ago
2006
ACM
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
179
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
254
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
We present an efficient method for feature correspondence and object-based image matching, which exploits both photometric similarity and pairwise geometric consistency from local ...