Sciweavers

20778 search results - page 195 / 4156
» Algorithms for Data Migration
Sort
View
KDD
2002
ACM
85views Data Mining» more  KDD 2002»
16 years 6 months ago
DualMiner: a dual-pruning algorithm for itemsets with constraints
Cristian Bucila, Johannes Gehrke, Daniel Kifer, Wa...
JDCTA
2010
152views more  JDCTA 2010»
15 years 1 months ago
Spatial Clustering Algorithm Based on Hierarchical-Partition Tree
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Zhongzhi Li, Xuegang Wang
COMPGEOM
2005
ACM
15 years 8 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
IPPS
2006
IEEE
16 years 14 days ago
An entropy-based algorithm for time-driven software instrumentation in parallel systems
While monitoring, instrumented long running parallel applications generate huge amount of instrumentation data. Processing and storing this data incurs overhead, and perturbs the ...
A. Ozmen
SIGMOD
2000
ACM
212views Database» more  SIGMOD 2000»
15 years 10 months ago
SQLEM: Fast Clustering in SQL using the EM Algorithm
Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in...
Carlos Ordonez, Paul Cereghini