6905 search results - page 899 / 1381 » Querying Multidimensional Databases |
142
click to vote
ICDM
2007
IEEE
16 years 19 days ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
237
Voted
SSD
2007
Springer
16 years 13 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
197
click to vote
CLUSTER
2005
IEEE
15 years 12 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
206
click to vote
JCDL
2003
ACM
15 years 11 months ago
2003
ACM
The increasing power of techniques to model complex geometry and extract meaning from 3D information create complex data that must be described, stored, and displayed to be useful...
173
click to vote
GIS
2010
ACM
15 years 4 months ago
2010
ACM
This paper proposes an efficient, decentralized algorithm for determining the topological relationship between two regions monitored by a geosensor network. Many centralized algo...