Sciweavers

2600 search results - page 47 / 520
» Clustering with or without the Approximation
Sort
View
ICTAI
2006
IEEE
14 years 3 months ago
Minimum Spanning Tree Based Clustering Algorithms
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
Oleksandr Grygorash, Yan Zhou, Zach Jorgensen
VLDB
1994
ACM
121views Database» more  VLDB 1994»
14 years 1 months ago
The Impact of Global Clustering on Spatial Database Systems
Global clustering has rarely been investigated in the area of spatial database systems although dramatic performance improvements can be achieved by using suitable techniques. In ...
Thomas Brinkhoff, Hans-Peter Kriegel
EUSFLAT
2009
163views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
A Fuzzy Set Approach to Ecological Knowledge Discovery
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
Arkadiusz Salski
MOC
2000
102views more  MOC 2000»
13 years 8 months ago
Finite element approximation for equations of magnetohydrodynamics
Abstract. We consider the equations of stationary incompressible magnetohydrodynamics posed in three dimensions, and treat the full coupled system of equations with inhomogeneous b...
Matthias Wiedmer
FGCN
2008
IEEE
240views Communications» more  FGCN 2008»
14 years 3 months ago
Data Compression Algorithm Based on Hierarchical Cluster Model for Sensor Networks
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...
Tongsen Wang, Lei Wang, Zhijun Xie, Ronghua Yang