Login Paper Search My Schedule Paper Index Help

My ICASSP 2013 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Clicking on the Add button next to a paper title will add that paper to your custom schedule.
Clicking on the Remove button next to a paper will remove that paper from your custom schedule.

MLSP-P3: Learning Theory and Algorithms I

Session Type: Poster
Time: Wednesday, May 29, 08:00 - 10:00
Location: Poster Area E
Session Chair: Saeid Sanei, University of Surrey
 
  MLSP-P3.1: CONVEX APPROXIMATION OF THE NP-HARD SEARCH PROBLEM IN FEATURE SUBSET SELECTION
         Tofigh Naghibi; ETH Zurich
         Sarah Hoffmann; ETH Zurich
         Beat Pfister; ETH Zurich
 
  MLSP-P3.2: NEAREST-NEIGHBOR DISTRIBUTED LEARNING UNDER COMMUNICATION CONSTRAINTS
         Stefano Marano; University of Salerno
         Vincenzo Matta; University of Salerno
         Peter Willett; University of Connecticut
 
  MLSP-P3.3: DISCRIMINATIVE DICTIONARY LEARNING VIA MUTUAL EXCLUSION
         Raghu Raj; U.S. Naval Research Laboratory
 
  MLSP-P3.4: STAGEWISE K-SVD TO DESIGN EFFICIENT DICTIONARIES FOR SPARSE REPRESENTATIONS
         Cristian Rusu; University Politehnica of Bucharest
         Bogdan Dumitrescu; University Politehnica of Bucharest
 
  MLSP-P3.5: DISTRIBUTED OPTIMIZATION VIA ADAPTIVE REGULARIZATION FOR LARGE PROBLEMS WITH SEPARABLE CONSTRAINTS
         Elad Gilboa; Washington University in St. Louis
         Phani Chavali; Washington University in St. Louis
         Peng Yang; Washington University in St. Louis
         Arye Nehorai; Washington University in St. Louis
 
  MLSP-P3.6: SMOOTHED SIMCO FOR DICTIONARY LEARNING: HANDLING THE SINGULARITY ISSUE
         Xiaochen Zhao; Imperial College London
         Guangyu Zhou; Imperial College London
         Wei Dai; Imperial College London
 
  MLSP-P3.7: TRADEOFFS IN IMPROVED SCREENING OF LASSO PROBLEMS
         Yun Wang; Princeton University
         Zhen James Xiang; Princeton University
         Peter J. Ramadge; Princeton University
 
  MLSP-P3.8: A GENERATIVE SEMI-SUPERVISED MODEL FOR MULTI-VIEW LEARNING WHEN SOME VIEWS ARE LABEL-FREE
         Gaole Jin; Oregon State University
         Raviv Raich; Oregon State University
         David Miller; The Pennsylvania State University
 
  MLSP-P3.9: THE 2-CODEWORD SCREENING TEST FOR LASSO PROBLEMS
         Hao Wu; Hong Kong University of Science and Technology
         Peter J. Ramadge; Princeton University
 
  MLSP-P3.10: END-TO-END LEARNING OF PARSING MODELS FOR INFORMATION RETRIEVAL
         Jennifer Gillenwater; University of Pennsylvania
         Xiaodong He; Microsoft Research
         Jianfeng Gao; Microsoft Research
         Li Deng; Microsoft Research
 
  MLSP-P3.11: BI-ALTERNATING DIRECTION METHOD OF MULTIPLIERS
         Guoqiang Zhang; Delft University of Technology
         Richard Heusdens; Delft University of Technology
 
  MLSP-P3.12: ONLINE MULTI-LABEL LEARNING WITH ACCELERATED NONSMOOTH STOCHASTIC GRADIENT DESCENT
         Sunho Park; Pohang University of Science and Technology (POSTECH)
         Seungjin Choi; Pohang University of Science and Technology (POSTECH)
 
  MLSP-P3.13: LP-REGULARIZED OPTIMIZATION BY USING ORTHANT-WISE APPROACH FOR INDUCING SPARSITY
         Takumi Kobayashi; National Institute of Advanced Industrial Science and Technology
 
  MLSP-P3.14: AN ENHANCED SPLITTING-WHILE-MERGING ALGORITHM WITH FINITE MIXTURE MODELS
         Rui Fa; Brunel University
         Asoke K. Nandi; Brunel University