Sciweavers

400 search results - page 43 / 80
» An Algorithm for the Reduction of Linear DAE
Sort
View
ICASSP
2011
IEEE
13 years 14 days ago
Online performance guarantees for sparse recovery
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
Raja Giryes, Volkan Cevher
ICML
2005
IEEE
14 years 9 months ago
Multimodal oriented discriminant analysis
Linear discriminant analysis (LDA) has been an active topic of research during the last century. However, the existing algorithms have several limitations when applied to visual d...
Fernando De la Torre, Takeo Kanade
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 2 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad
COCOON
2005
Springer
14 years 2 months ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 2 months ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran