1668 search results - page 308 / 334 » Two Philosophical Applications of Algorithmic Information Th... |
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
In this paper, we present a general framework to discover spatial associations and spatio-temporal episodes for scientific datasets. In contrast to previous work in this area, fea...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
PG
2007
IEEE
14 years 2 months ago
2007
IEEE
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...