Sciweavers

4124 search results - page 593 / 825
» Improved Algorithms for Data Migration
Sort
View
153
Voted
COMPGEOM
2010
ACM
15 years 10 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
15 years 9 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
16 years 6 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
16 years 5 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
161
Voted
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 5 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...