1385 search results - page 35 / 277 » Clustering by Random Projections |
BMCBI
2007
14 years 12 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
AI
2001
Springer
15 years 4 months ago
2001
Springer
In fast-paced software projects, engineers don’t have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight ...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
107
click to vote
ICPR
2006
IEEE
16 years 27 days ago
2006
IEEE
Images obtained with catadioptric sensors contain significant deformations which prevent the direct use of classical image treatments. Thus, Markov Random Fields (MRF) whose usefu...
WWW
2010
ACM
15 years 6 months ago
2010
ACM
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...