Sciweavers

103 search results - page 11 / 21
» An Efficient Sparse Regularity Concept
Sort
View
BALT
2006
15 years 3 months ago
A Multiple Correspondence Analysis to Organize Data Cubes
Abstract. On Line Analytical Processing (OLAP) is a technology basically created to provide users with tools in order to explore and navigate into data cubes. Unfortunately, in hug...
Riadh Ben Messaoud, Omar Boussaid, Sabine Loudcher...
ICML
2010
IEEE
15 years 27 days ago
A scalable trust-region algorithm with application to mixed-norm regression
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
15 years 3 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
TVLSI
2002
95views more  TVLSI 2002»
14 years 11 months ago
Efficient inductance extraction using circuit-aware techniques
We propose two practical approaches for on-chip inductance extraction to obtain a highly sparsified and accurate inverse inductance matrix K. Both approaches differ from previous ...
Haitian Hu, Sachin S. Sapatnekar
ICML
2009
IEEE
16 years 19 days ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas