2168 search results - page 38 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
SARA
2009
Springer
14 years 2 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
TIP
2008
13 years 7 months ago
2008
In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. Three methods for sp...
ARITH
2007
IEEE
14 years 2 months ago
2007
IEEE
The floating point unit of the next generation PowerPC is detailed. It has been tested at over 5 GHz. The design supports an extremely aggressive cycle time of 13 FO4 using a tech...
AINA
2006
IEEE
13 years 11 months ago
2006
IEEE
Achieving IP handoff with a short latency and minimal packet loss is essential for mobile devices that roam across IP subnets. Many existing solutions require changes to be made t...
NIPS
2007
13 years 9 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...