Sciweavers

1056 search results - page 110 / 212
» Accelerated Shift-and-Add Algorithms
Sort
View
WSCG
2001
89views more  WSCG 2001»
13 years 11 months ago
Searching Triangle Strips Guided by Simplification Criterion
Triangle strips are widely used as a method to accelerate the visualisation process of polygon models in interactive graphics applications. Another widely used method to improve d...
Oscar Belmonte, José Ribelles, Inmaculada R...
AAMAS
2007
Springer
13 years 10 months ago
Parallel Reinforcement Learning with Linear Function Approximation
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
Matthew Grounds, Daniel Kudenko
IJCGA
2008
132views more  IJCGA 2008»
13 years 10 months ago
Constructing the City Voronoi Diagram Faster
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
Robert Görke, Chan-Su Shin, Alexander Wolff
TMI
2008
67views more  TMI 2008»
13 years 10 months ago
A Fast Method for Designing Time-Optimal Gradient Waveforms for Arbitrary k-Space Trajectories
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
Michael Lustig, Seung-Jean Kim, John M. Pauly
CG
1999
Springer
13 years 9 months ago
Efficient visibility processing for projective texture mapping
Projective texture-mapping is a powerful tool for image-based rendering. However, visibility information must be obtained in order to project correct textures onto the geometric s...
Yizhou Yu