Sciweavers

7006 search results - page 351 / 1402
» Approximation Algorithms
Sort
View
VC
2008
138views more  VC 2008»
15 years 4 months ago
A GPU-based light hierarchy for real-time approximate illumination
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Hyunwoo Ki, Kyoungsu Oh
CAGD
2004
76views more  CAGD 2004»
15 years 4 months ago
Topologically consistent trimmed surface approximations based on triangular patches
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
Rida T. Farouki, Chang Yong Han, Joel Hass, Thomas...
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 2 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
JGO
2010
72views more  JGO 2010»
15 years 2 months ago
Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point prob
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions ΩA of t...
Lu-Chuan Ceng, Nicolas Hadjisavvas, Ngai-Ching Won...
EMSOFT
2004
Springer
15 years 9 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross