Sciweavers

3823 search results - page 36 / 765
» Experiments with Random Projection
Sort
View
MCS
2007
Springer
14 years 4 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
BMCBI
2007
154views more  BMCBI 2007»
13 years 10 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
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...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
AI
2001
Springer
14 years 2 months ago
How AI Can Help SE; or: Randomized Search Not Considered Harmful
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 ...
Tim Menzies, Harshinder Singh
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 10 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
ICPR
2006
IEEE
14 years 11 months ago
Adaptative Markov Random Fields for Omnidirectional Vision
Images obtained with catadioptric sensors contain significant deformations which prevent the direct use of classical image treatments. Thus, Markov Random Fields (MRF) whose usefu...
Cédric Demonceaux, Pascal Vasseur