616 search results - page 104 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
Publication
We describe a general-purpose method for the accurate and robust interpretation of a data set of p-dimensional points by several deformable prototypes. This method is based on the ...
COMCOM
2006
13 years 7 months ago
2006
In wireless sensor networks (WSNs), when a stimulus or event is detected within a particular region, data reports from the neighboring sensor nodes (sources) are sent to the sink ...
SIAMSC
2008
13 years 7 months ago
2008
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...
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
CIKM
1994
Springer
13 years 11 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...