332 search results - page 20 / 67 » Parameterized Graph Separation Problems |
COMBINATORICA
2008
14 years 12 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
105
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
TASLP
2008
14 years 11 months ago
2008
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...
107
click to vote
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
98
Voted
ICA
2004
Springer
15 years 5 months ago
2004
Springer
SOBI is a blind source separation algorithm based on time decorrelation. It uses multiple time autocovariance matrices, and performs joint diagonalization thus being more robust th...