Sciweavers

688 search results - page 91 / 138
» Computing with subspaces
Sort
View
ICIP
2003
IEEE
15 years 11 months ago
On the reconstruction of an image from its moments
Abstract--An image can be seen as an element of a vector space so that it can be expressed in terms of a series expansion of any non necessarily orthogonal base of this space. This...
Federico Thomas, Judit Martinez
157
Voted
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
15 years 11 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
ICCS
2007
Springer
15 years 3 months ago
Monte Carlo Numerical Treatment of Large Linear Algebra Problems
In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra problems. We consider applicability and efficiency of the Markov chain Monte Carlo...
Ivan Dimov, Vassil N. Alexandrov, Rumyana Papanche...
DATE
2005
IEEE
128views Hardware» more  DATE 2005»
15 years 3 months ago
Modeling Interconnect Variability Using Efficient Parametric Model Order Reduction
Assessing IC manufacturing process fluctuations and their impacts on IC interconnect performance has become unavoidable for modern DSM designs. However, the construction of parame...
Peng Li, Frank Liu, Xin Li, Lawrence T. Pileggi, S...
69
Voted
GFKL
2005
Springer
82views Data Mining» more  GFKL 2005»
15 years 3 months ago
Robust Multivariate Methods: The Projection Pursuit Approach
Projection pursuit was originally introduced to identify structures in multivariate data clouds (Huber, 1985). The idea of projecting data to a lowdimensional subspace can also be ...
Peter Filzmoser, Sven Serneels, Christophe Croux, ...