Sciweavers

999 search results - page 159 / 200
» Spectral simplex method
Sort
View
ICCV
2003
IEEE
15 years 3 months ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
15 years 2 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
NIPS
2004
14 years 11 months ago
Maximum Margin Clustering
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
Linli Xu, James Neufeld, Bryce Larson, Dale Schuur...
NIPS
2003
14 years 11 months ago
Clustering with the Connectivity Kernel
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
Bernd Fischer, Volker Roth, Joachim M. Buhmann
ICA
2010
Springer
14 years 10 months ago
Consistent Wiener Filtering: Generalized Time-Frequency Masking Respecting Spectrogram Consistency
Wiener filtering is one of the most widely used methods in audio source separation. It is often applied on time-frequency representations of signals, such as the short-time Fourier...
Jonathan Le Roux, Emmanuel Vincent, Yuu Mizuno, Hi...