847 search results - page 104 / 170 » Approximation algorithms for projective clustering |
114
Voted
ISSAC
1995
Springer
15 years 4 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
96
Voted
MICCAI
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. We present a general method for the computation of PDFbased characteristics of the tissue micro-architecture in MR imaging. The approach relies on the approximation of th...
120
Voted
BMCBI
2008
15 years 26 days ago
2008
Background: The increasing availability of fungal genome sequences provides large numbers of proteins for evolutionary and phylogenetic analyses. However the heterogeneity of data...
106
click to vote
CIBCB
2007
IEEE
15 years 7 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
115
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...