256 search results - page 43 / 52 » Approximation Algorithms for Hamming Clustering Problems |
JSSPP
2005
Springer
15 years 3 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
ICIP
1995
IEEE
15 years 1 months ago
1995
IEEE
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...
PAMI
2010
14 years 8 months ago
2010
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
APPT
2005
Springer
15 years 3 months ago
2005
Springer
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...
ALENEX
2009
14 years 10 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...