Sciweavers

146 search results - page 4 / 30
» Efficient algorithms for the block edit problems
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
14 years 11 months ago
An efficient algorithm for a class of fused lasso problems
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
Jun Liu, Lei Yuan, Jieping Ye
CSCW
2002
ACM
14 years 9 months ago
Achieving undo in bitmap-based collaborative graphics editing systems
Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Ex...
Xueyi Wang, Jiajun Bu, Chun Chen
63
Voted
WWW
2007
ACM
15 years 10 months ago
Homepage live: automatic block tracing for web personalization
The emergence of personalized homepage services, e.g. personalized Google Homepage and Microsoft Windows Live, has enabled Web users to select Web contents of interest and to aggr...
Jie Han, Dingyi Han, Chenxi Lin, Hua-Jun Zeng, Zhe...
IPPS
2002
IEEE
15 years 2 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee