Sciweavers

1221 search results - page 167 / 245
» Balanced graph partitioning
Sort
View
TASLP
2008
123views more  TASLP 2008»
13 years 10 months ago
Normalized Cuts for Predominant Melodic Source Separation
The predominant melodic source, frequently the singing voice, is an important component of musical signals. In this paper, we describe a method for extracting the predominant sourc...
Mathieu Lagrange, Luis Gustavo Martins, Jennifer M...
TC
1998
13 years 9 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro
SIGIR
2008
ACM
13 years 9 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 8 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
IPPS
2010
IEEE
13 years 8 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart