5692 search results - page 164 / 1139 » Challenges and Unsolved Problems |
118
click to vote
ECML
2007
Springer
15 years 7 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
113
click to vote
SC
2005
ACM
15 years 6 months ago
2005
ACM
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
103
click to vote
ER
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Locating specific chunks (records) of information within documents on the web is an interesting and nontrivial problem. If the problem of locating and separating records...
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Structure-from-motion (SfM) is an important computer vision problem and largely relies on the quality of feature tracking. In image sequences, if disjointed tracks caused...
AAAI
2007
15 years 3 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...