374 search results - page 61 / 75 » New Algorithms for Fast Discovery of Association Rules |
NIPS
2004
14 years 11 months ago
2004
Assume a uniform, multidimensional grid of bivariate data, where each cell of the grid has a count ci and a baseline bi. Our goal is to find spatial regions (d-dimensional rectang...
ISER
1999
Springer
15 years 1 months ago
1999
Springer
In this paper, we present a new approach for continuous probabilistic mapping. The objective is to build metric maps of unknown environments through cooperation between multiple au...
89
Voted
IADIS
2004
14 years 11 months ago
2004
With rapid development of the Internet, e-learning system has become more and more popular. Currently, to solve the issue of sharing and reusing of teaching materials in different...
151
Voted
AMTA
2004
Springer
15 years 3 months ago
2004
Springer
The public demonstration of a Russian-English machine translation system in New York in January 1954 – a collaboration of IBM and Georgetown University – caused a great deal of...
66
Voted
SAC
2002
ACM
14 years 9 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...