2168 search results - page 10 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
GECCO
2010
Springer
14 years 13 days ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
VISUALIZATION
2005
IEEE
14 years 1 months ago
2005
IEEE
Real-time rendering of massively textured 3D scenes usually involves two major problems: Large numbers of texture switches are a well-known performance bottleneck and the set of s...