985 search results - page 52 / 197 » Piercing Convex Sets |
GMP
2000
IEEE
14 years 1 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
TCOM
2008
13 years 9 months ago
2008
In order to reduce the inter-carrier interference (ICI) produced by frequency offset in OFDM systems, we set up an optimization problem to find the transmission pulse which maximi...
AUTOMATICA
2002
13 years 8 months ago
2002
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...
AAAI
2011
12 years 9 months ago
2011
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...