9719 search results - page 354 / 1944 » Answer Set Optimization |
197
click to vote
IJCAI
2003
15 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
183
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
179
Voted
SIAMJO
2008
15 years 6 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
161
click to vote
DAM
1998
15 years 6 months ago
1998
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
183
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In many image processing problems, it is required to extract small scale details from an image or a set of images. In this paper, we introduce a new framework for extracting small...