2944 search results - page 291 / 589 » Improving Bound Propagation |
145
click to vote
TIP
2010
15 years 5 months ago
2010
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...
216
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
189
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
237
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
180
click to vote
JGO
2010
15 years 1 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...