597 search results - page 71 / 120 » New Algorithms for Improved Transcendental Functions on IA-6... |
183
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
153
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
189
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
155
click to vote
CGF
2006
15 years 6 months ago
2006
We present the Optimizing Control Variate (OCV) estimator, a new estimator for Monte Carlo rendering. Based upon a deterministic sampling framework, OCV allows multiple importance...
167
click to vote
ICPP
2005
IEEE
15 years 11 months ago
2005
IEEE
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...