Sciweavers

17 search results - page 1 / 4
» Focuss is a convex-concave procedure
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Focuss is a convex-concave procedure
We show the powerful sparse signal recovery approach FOCUSS is a convex-concave procedure. It follows a Newton-like decent direction by retaining the positive definite component ...
Mashud Hyder, Kaushik Mahata
ICANN
2005
Springer
13 years 11 months ago
The LCCP for Optimizing Kernel Parameters for SVM
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
CVPR
2010
IEEE
13 years 11 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
AIPS
2006
13 years 6 months ago
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
Jörg Hoffmann, Carla P. Gomes, Bart Selman
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 5 months ago
Detecting Errors in Spreadsheets
The paper presents two complementary strategies for identifying errors in spreadsheet programs. The strategies presented are grounded on the assumption that spreadsheets are softw...
Yirsaw Ayalew, Markus Clermont, Roland T. Mitterme...