Sciweavers

10051 search results - page 12 / 2011
» A Dynamic Separator Algorithm
Sort
View
ICA
2007
Springer
15 years 6 months ago
First Stereo Audio Source Separation Evaluation Campaign: Data, Algorithms and Results
This article provides an overview of the first stereo audio source separation evaluation campaign, organized by the authors. Fifteen underdetermined stereo source separation algor...
Emmanuel Vincent, Hiroshi Sawada, Pau Bofill, Shoj...
104
Voted
MP
2010
116views more  MP 2010»
14 years 10 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
108
Voted
DCC
2004
IEEE
16 years 4 hour ago
A Foreground/Background Separation Algorithm for Image Compression
Patrice Y. Simard, Henrique S. Malvar, James Rinke...
TIT
2008
103views more  TIT 2008»
15 years 9 days ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
SPAA
1993
ACM
15 years 4 months ago
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
Philip N. Klein