370 search results - page 16 / 74 » Bounded modified realizability |
IPPS
1997
IEEE
14 years 24 days ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
MANSCI
2008
13 years 8 months ago
2008
Value-at-Risk (VaR) is one of the most widely accepted risk measures in the financial and insurance industries, yet efficient optimization of VaR remains a very difficult problem....
ICIP
2004
IEEE
14 years 10 months ago
2004
IEEE
We modify the multilevel successive elimination algorithm (MSEA) to make it compatible with the motion estimation required for the H.264/AVC video coding standard. The algorithm m...
COLT
2000
Springer
14 years 6 days ago
2000
Springer
In this paper we examine master regression algorithms that leverage base regressors by iteratively calling them on modified samples. The most successful leveraging algorithm for c...
CGF
2005
13 years 8 months ago
2005
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive....