Sciweavers

475 search results - page 46 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
CIKM
2009
Springer
13 years 11 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang
PVLDB
2008
118views more  PVLDB 2008»
13 years 7 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
13 years 12 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
PG
1999
IEEE
13 years 12 months ago
An Improved TIN Compression Using Delaunay Triangulation
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper i...
Yang-Soo Kim, Dong-Gyu Park, Ho-Youl Jung, Hwan-Gu...
TVCG
2012
196views Hardware» more  TVCG 2012»
11 years 10 months ago
Robust Morse Decompositions of Piecewise Constant Vector Fields
—In this paper, we introduce a new approach to computing a Morse decomposition of a vector field on a triangulated manifold surface. The basic idea is to convert the input vector...
Andrzej Szymczak, Eugene Zhang