15494 search results - page 207 / 3099 » Computing dynamic clusters |
173
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
190
Voted
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
188
click to vote
CCGRID
2006
IEEE
16 years 12 days ago
2006
IEEE
In this paper we propose a peer-to-peer (P2P) prototype (INTCTD) for intrusion detection over an overlay network. INTCTD is a distributed system based on neural networks for detec...
161
click to vote
CCGRID
2005
IEEE
15 years 12 months ago
2005
IEEE
Addressing the long term preservation issues associated with scientific data is a complex challenge compounded by: the scale and multidisciplinary nature of the problem; the wide ...
193
click to vote
CCGRID
2005
IEEE
15 years 12 months ago
2005
IEEE
The scheme of advance reservations in dynamically provisioned optical networks is novel, and there are no gridbased applications designed to utilize this scheme. We formally defi...