Sciweavers

895 search results - page 10 / 179
» Approximate convex decomposition
Sort
View
ESA
2006
Springer
118views Algorithms» more  ESA 2006»
15 years 1 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
15 years 1 months ago
Using convex hulls to represent classifier conditions
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
Pier Luca Lanzi, Stewart W. Wilson
ICASSP
2010
IEEE
14 years 9 months ago
Sound enhancement using sparse approximation with speclets
This paper addresses an innovative approach to informed enhancement of damaged sound. It uses sparse approximations with a learned dictionary of atoms modeling the main components...
Manuel Moussallam, Pierre Leveau, Si-Mohamed Aziz ...
VISUALIZATION
1995
IEEE
15 years 1 months ago
Authenticity Analysis of Wavelet Approximations in Visualization
Wavelet transforms include data decompositions and reconstructions. This paper is concerned with the authenticity issues of the data decomposition, particularly for data visualiza...
Pak Chung Wong, R. Daniel Bergeron
64
Voted
JSC
2007
97views more  JSC 2007»
14 years 9 months ago
On approximate triangular decompositions in dimension zero
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
Marc Moreno Maza, Gregory J. Reid, Robin Scott, We...