820 search results - page 102 / 164 » Finding low-utility data structures |
ICANN
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
IVS
2010
13 years 3 months ago
2010
This article summarises the current state of research into multiple tree visualisations. It discusses the spectrum of current representation techniques used on single trees, pairs ...
CINQ
2004
Springer
14 years 2 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
DEXAW
2000
IEEE
14 years 1 months ago
2000
IEEE
Current models for cardinal directions, such as north and northeast, are either point-based or region-based, but no models exist that apply equally, independent of the geometric d...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...