Sciweavers

1382 search results - page 272 / 277
» Formal Analysis of Online Algorithms
Sort
View
CIKM
2010
Springer
14 years 9 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
WWW
2005
ACM
16 years 9 days ago
Gimme' the context: context-driven automatic semantic annotation with C-PANKOW
Without the proliferation of formal semantic annotations, the Semantic Web is certainly doomed to failure. In earlier work we presented a new paradigm to avoid this: the 'Sel...
Günter Ladwig, Philipp Cimiano, Steffen Staab
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
16 years 1 days ago
Email data cleaning
Addressed in this paper is the issue of `email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus i...
Jie Tang, Hang Li, Yunbo Cao, ZhaoHui Tang
VLDB
2005
ACM
185views Database» more  VLDB 2005»
15 years 12 months ago
Storing and querying XML data using denormalized relational databases
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
Andrey Balmin, Yannis Papakonstantinou
POPL
2010
ACM
15 years 6 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak