135 search results - page 17 / 27 » Efficiently Solving the Fractional Trust Region Problem |
TIP
2010
14 years 4 months ago
2010
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...
PPL
2010
14 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
75
Voted
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
With the advent of deep sub-micron (DSM) era, floorplanning has become increasingly important in physical design process. In this paper we clarify a misunderstanding in using Lag...
ERCIMDL
2000
Springer
15 years 1 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
120
click to vote
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...