5595 search results - page 741 / 1119 » Approximation Algorithms for Clustering Problems |
205
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
169
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
167
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
189
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper deals with the reconstruction of smooth, flexible, isometrically embedded flat surfaces in 3D, such as a sheet of paper or a flag waving in the wind, from a set of 2...
149
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In a reverberant scenario, phase transformed weighted algorithms are more robust than Maximum Likelihood (ML) because of the insufficiency of the data model to incorporate reverb...