Sciweavers

282 search results - page 51 / 57
» An efficient algorithm in the HLA time management
Sort
View
WWW
2007
ACM
16 years 10 days ago
Towards effective browsing of large scale social annotations
This paper is concerned with the problem of browsing social annotations. Today, a lot of services (e.g., Del.icio.us, Filckr) have been provided for helping users to manage and sh...
Rui Li, Shenghua Bao, Yong Yu, Ben Fei, Zhong Su
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
15 years 11 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
75
Voted
CIKM
2008
Springer
15 years 1 months ago
Achieving both high precision and high recall in near-duplicate detection
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
Lian'en Huang, Lei Wang, Xiaoming Li
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 2 days ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
16 years 2 days ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han