588 search results - page 109 / 118 » Computing the Dimension of Linear Subspaces |
97
Voted
CORR
2007
Springer
14 years 11 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
JCT
2002
14 years 11 months ago
2002
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
124
click to vote
JMIV
1998
14 years 11 months ago
1998
Singular points of scalar images in any dimensions are classified by a topological number. This number takes integer values and can efficiently be computed as a surface integral ...
92
Voted
MP
2010
14 years 10 months ago
2010
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
106
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Most genomic data have ultra-high dimensions with more than 10,000 genes (probes). Regularization methods with L1 and Lp penalty have been extensively studied in survi...