3068 search results - page 315 / 614 » Clustering with Multiple Graphs |
166
click to vote
EURODAC
1994
IEEE
15 years 11 months ago
1994
IEEE
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...
168
click to vote
PAKDD
2004
ACM
16 years 2 days 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...
215
click to vote
IPCV
2008
15 years 8 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 ...
165
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
191
Voted
HIS
2009
15 years 4 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...