Sciweavers

2124 search results - page 290 / 425
» Repairing Structurally Complex Data
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 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
AMW
2010
13 years 10 months ago
Run-time Optimization for Pipelined Systems
Traditional optimizers fail to pick good execution plans, when faced with increasingly complex queries and large data sets. This failure is even more acute in the context of XQuery...
Riham Abdel Kader, Maurice van Keulen, Peter A. Bo...
EL
2008
166views more  EL 2008»
13 years 9 months ago
The digital library as an enterprise: the Zachman approach
Purpose: Examines the needs of digital library stakeholders and how a collaborative digital library might be designed to meet these needs. The collaborative digital library has be...
Abdullah Abrizah, A. N. Zainab
EOR
2007
110views more  EOR 2007»
13 years 9 months ago
A hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
Hanene Azzag, Gilles Venturini, Antoine Oliver, Ch...
BMVC
2010
13 years 7 months ago
Manifold Alignment via Corresponding Projections
In this paper, we propose a novel manifold alignment method by learning the underlying common manifold with supervision of corresponding data pairs from different observation sets...
Deming Zhai, Bo Li, Hong Chang, Shiguang Shan, Xil...