507 search results - page 14 / 102 » Computing Sparse Multiples of Polynomials |
STOC
2000
ACM
14 years 1 days ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
AAAI
2007
13 years 10 months ago
2007
A mathematical programming formulation is proposed to eliminate irrelevant and redundant features for collaborative computer aided diagnosis which requires to detect multiple clin...
ICA
2007
Springer
13 years 11 months ago
2007
Springer
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
KDD
2010
ACM
13 years 9 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...