Why so many clustering algorithms: a position paper
ACM SIGKDD Explorations Newsletter
Non-crisp Clustering by Fast, Convergent, and Robust Algorithms
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
Categorizing Visitors Dynamically by Fast and Robust Clustering of Access Logs
WI '01 Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development
Fast and Robust General Purpose Clustering Algorithms
Data Mining and Knowledge Discovery
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
Fast and robust general purpose clustering algorithms
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
| Hi-index | 0.00 |
We explain how factoring polynomials modulo primes can be used in proving that for certain geometric optimisation problems there exists no exact algorithm under models of computation where the root of an algebraic equation is obtained using arithmetic operations and the extraction of kth roots. This leaves only numerical or symbolic approximations to the solution of these problems under these models. This letter describes work which is described in more detail in Bajaj (1984)-here we concentrate on the use of computer algebra, in particular factoring polynomials over the rationals using the MACSVMA system.