Sciweavers

1538 search results - page 43 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
MPtracker: A new multi-pitch detection and separation algorithm for mixed speech signals
We present MPtracker, a new algorithm for tracking and separating the pitch frequencies of two speakers from their mixture. The pitch frequencies are detected by introducing a nov...
Mohammad Hossein Radfar, Richard M. Dansereau, Wai...
BROADNETS
2006
IEEE
14 years 4 months ago
Traffic Grooming Techniques in Optical Networks
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
Yabin Ye, Hagen Woesner, Imrich Chlamtac
JMLR
2012
12 years 17 days ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
DIS
2006
Springer
14 years 1 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
JGAA
2006
127views more  JGAA 2006»
13 years 10 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...