Sciweavers

20778 search results - page 238 / 4156
» Algorithms for Data Migration
Sort
View
DATESO
2009
158views Database» more  DATESO 2009»
15 years 4 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
CVPR
2004
IEEE
16 years 8 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade
CVPR
2004
IEEE
16 years 8 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
INFOSCALE
2006
ACM
16 years 14 days ago
PENS: an algorithm for density-based clustering in peer-to-peer systems
Huge amounts of data are available in large-scale networks of autonomous data sources dispersed over a wide area. Data mining is an essential technology for obtaining hidden and v...
Mei Li, Guanling Lee, Wang-Chien Lee, Anand Sivasu...
ICDE
2000
IEEE
96views Database» more  ICDE 2000»
16 years 7 months ago
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani