Sciweavers

1391 search results - page 137 / 279
» Optimally Sparse Frames
Sort
View
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 4 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
ICDCS
2007
IEEE
15 years 10 months ago
Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks
While extensive studies have been carried out in the past several years for many sensor applications, they cannot be applied to the network with extremely low and intermittent con...
Yu Wang, Hongyi Wu, Feng Lin, Nian-Feng Tzeng
PPOPP
2006
ACM
15 years 10 months ago
Optimizing irregular shared-memory applications for distributed-memory systems
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
Ayon Basumallik, Rudolf Eigenmann
CVPR
2012
IEEE
13 years 7 months ago
Online robust image alignment via iterative convex optimization
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
Yi Wu, Bin Shen, Haibin Ling
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
15 years 11 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...