Sciweavers

2694 search results - page 72 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
NIPS
2004
14 years 11 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola
TASLP
2010
142views more  TASLP 2010»
14 years 4 months ago
Beyond the Narrowband Approximation: Wideband Convex Methods for Under-Determined Reverberant Audio Source Separation
We consider the problem of extracting the source signals from an under-determined convolutive mixture assuming known mixing filters. State-of-the-art methods operate in the time-fr...
M. Kowalski, Emmanuel Vincent, Rémi Gribonv...
CEC
2010
IEEE
14 years 11 months ago
Many-objective Distinct Candidates Optimization using Differential Evolution on centrifugal pump design problems
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...
Peter Dueholm Justesen, Rasmus K. Ursem
ICIP
2010
IEEE
14 years 7 months ago
Total subset variation prior
We propose total subset variation (TSV), a convexity preserving generalization of the total variation (TV) prior, for higher order clique MRF. A proposed differentiable approximat...
Sanjeev Kumar, Truong Q. Nguyen
IPPS
1994
IEEE
15 years 1 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...