824 search results - page 129 / 165 » Efficient Distance Computation Between Non-Convex Objects |
PAMI
2006
13 years 7 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
TC
2008
13 years 7 months ago
2008
As one of the fundamental issues in wireless sensor networks (WSNs), the sensor localization problem has recently received extensive attention. In this work, we investigate this pr...
TWC
2008
13 years 7 months ago
2008
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...