Sciweavers

332 search results - page 20 / 67
» Parameterized Graph Separation Problems
Sort
View
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 8 months ago
A separation theorem in property testing
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...
Noga Alon, Asaf Shapira
CORR
2008
Springer
169views Education» more  CORR 2008»
13 years 8 months ago
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
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...
Mingyu Xiao, Leizhen Cai, Andrew C. Yao
TASLP
2008
123views more  TASLP 2008»
13 years 8 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...
IWPEC
2009
Springer
14 years 3 months ago
What Makes Equitable Connected Partition Easy
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...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
ICA
2004
Springer
14 years 1 months ago
Second-Order Blind Source Separation Based on Multi-dimensional Autocovariances
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...
Fabian J. Theis, Anke Meyer-Bäse, Elmar Wolfg...