961 search results - page 140 / 193 » Significance-Driven Graph Clustering |
130
click to vote
PAKDD
2004
ACM
15 years 9 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
177
click to vote
IPCV
2008
15 years 5 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
136
click to vote
PVLDB
2010
15 years 2 months ago
2010
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
143
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
129
click to vote
KIVS
2005
Springer
15 years 10 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...