174 search results - page 11 / 35 » Algorithms for center and Tverberg points |
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...
STOC
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
CIT
2007
Springer
14 years 1 months ago
2007
Springer
In this paper a fuzzy quantization dequantization criterion is used to propose an evaluation technique to determine the appropriate clustering algorithm suitable for a particular ...
MOBICOM
2009
ACM
14 years 1 months ago
2009
ACM
In November 2008, the FCC ruled that the digital TV whitespaces be used for unlicensed access. This is an exciting development because DTV whitespaces are in the low frequency ran...