89 search results - page 12 / 18 » Sparse Recovery by Non-convex Optimization -- Instance Optim... |
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
The state of the art for solving the phase retrieval problem in two dimensions relies heavily on the algorithms proposed by Gerchberg, Saxton, and Fienup. Despite the widespread u...
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
IOR
2011
13 years 2 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
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...
EOR
2007
13 years 7 months ago
2007
Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassemb...