33 search results - page 6 / 7 » Proximal Interior Point Approach for Solving Convex Semi-inf... |
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
INFOCOM
2007
IEEE
14 years 3 days ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
SIGPRO
2010
13 years 4 months ago
2010
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
IJCNN
2006
IEEE
13 years 11 months ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
ASPDAC
2009
ACM
14 years 9 days ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...