Sciweavers

1161 search results - page 30 / 233
» Approximation schemes for clustering problems
Sort
View
ICALP
2001
Springer
15 years 2 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
AMC
2004
105views more  AMC 2004»
14 years 9 months ago
Block matrix Sinc-Galerkin solution of the wind-driven current problem
A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an...
Sanoe Koonprasert, Kenneth L. Bowers
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
ICASSP
2010
IEEE
14 years 9 months ago
Learning from high-dimensional noisy data via projections onto multi-dimensional ellipsoids
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...
Liuling Gong, Dan Schonfeld
IBPRIA
2005
Springer
15 years 3 months ago
Solving Particularization with Supervised Clustering Competition Scheme
The process of mixing labelled and unlabelled data is being recently studied in semi-supervision techniques. However, this is not the only scenario in which mixture of labelled and...
Oriol Pujol, Petia Radeva