2631 search results - page 228 / 527 » A Practical Method for the Sparse Resultant |
200
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Modelling the time-related behaviour of biological systems is essential for understanding their dynamic responses to perturbations. In metabolic profiling studies, the...
237
click to vote
ACCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In set-based face recognition, each set of face images is often represented as a linear/nonlinear manifold and the Principal Angles (PA) or Kernel PAs are exploited to me...
214
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
183
click to vote
ICML
2007
IEEE
16 years 8 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
189
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...