3475 search results - page 54 / 695 » Backbones in Optimization and Approximation |
SIAMSC
2008
13 years 10 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
IUI
2012
ACM
12 years 5 months ago
2012
ACM
Numerous interaction techniques have been developed that make “virtual” pointing at targets in graphical user interfaces easier than analogous physical pointing tasks by invok...
ICCS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
SIGDIAL
2010
13 years 8 months ago
2010
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
ANOR
2002
13 years 10 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...