Sciweavers

6 search results - page 1 / 2
» Reliably Capture Local Clusters in Noisy Domains From Parall...
Sort
View
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
13 years 11 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 4 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
IPPS
2006
IEEE
13 years 11 months ago
IMAGE: an approach to building standards-based enterprise grids
We describe a system for aggregating heterogeneous resources from distinct administrative domains into an enterprise-wide compute grid, such that the aggregated resource provides ...
G. Mateescu, Masha Sosonkina
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 4 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris