4843 search results - page 390 / 969 » The Shortcut Problem - Complexity and Approximation |
127
click to vote
AAAI
2006
15 years 6 months ago
2006
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
153
Voted
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
151
Voted
SIAMIS
2010
14 years 11 months ago
2010
Image restoration problems are often converted into large-scale, nonsmooth and nonconvex optimization problems. Most existing minimization methods are not efficient for solving su...
122
Voted
ASPDAC
1999
ACM
15 years 9 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
112
Voted
EOR
2006
15 years 4 months ago
2006
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...