T
Tanner graphs, LDPC
620 , 622–623
Target headers, genome-matching acceleration
178–179
Target processing, genome-matching acceleration
180
Task parallelism, chemical informatics
23
Task scheduling
gate-level
369–372
GPU-based parallelization
369
Taylor series, diffusion equation derivation
395
Template-based pipeline, speed-limit-sign recognition
500–505 , 508–514
Template-driven code, for ABM
algorithms and implementations
314
communication and transition function behavior scripting
317–319
core method
314
future work
324
overview
313
performance evaluation
321–323
real-time instanced agent visualization
319–320
state-based agent simulation
314–315
XML-driven CUDA code generation
315–317
Temporal data mining
core methodology
212–214
datasets and testbed
222
one thread per occurrence performance
222–224
one thread per occurrence strategy
215–219
serial episode mining
214
two-pass elimination approach
219–222
two-pass elimination performance
224–226
Temporal filtering, VSM
453
Tentative collision point, photon transport
252
Test benches
gate-level simulation
347–348 , 354–357 , 363
GPU-based logic simulator
357
Testing phase, SVM
302–303 , 305–306
Test reduce step, SVM
303–304 , 308
Texture buffer object (TBO), ABM visualization
320
Texture interpolation, fast spectral synthesis
basic problem
93–95
flux calculation and aggregation
95–96
future work
101
GRASSY platform
97–100
testing
100
Texture memory
brain connectivity reconstruction
802
DBT GPU acceleration
651–653
genome-matching
179–180
medical image processing
744
object detection
530
photon transport
259
radiographic image simulation
822
visual saliency motion estimator kernel
462
Texture packing, GRASSY platform
97
Thread block
ASR
611 , 613
atlas construction
779
Barnes-Hut n -body algorithm
91
black hole simulations
107
brain connnectivity reconstruction
804–805 , 807 , 810–811
B-spline registration
757 , 762–763 , 767–769
chemical informatics
23–24 , 32
de-mosaicing
588 , 590–592
electronic structure
62
fast circuit optimization
369 , 372–373
fast spectral synthesis
97–98 , 100
gate-level simulation
345–348 , 350–352 , 354–355
LB model
388
medical image processing
742
MO calculations
11 , 13 , 15 , 17
molecular electrostatics
45–49 , 51–55
n -body simulation
116–120 , 124–125
pattern matching
186 , 198
radiographic image simulation
821–822 , 827
random number generators
231–232 , 244
real-time stereo
476–477 , 479–481 , 483–484
RNA folding
205
SPIRiT MRI
730–732 , 735
SVM
297 , 303
SW algorithm
157 , 168
template-driven agent-based modeling
319 , 322–323
tomographic image reconstruction
684 , 686 , 688–689
VSM
461
Thread divergence
Barnes Hut n -body algorithm
75 , 80 , 82 , 84–87
black hole simulations
105–106
B-spline registration
763
DBT
652
image de-mosaicing
588
photon transport
250
quadrature grids
39
tomographic image reconstruction
679
Thread mapping, DBT
647 , 650–651 , 653–654
Thread-per-point method, quadrature grid DFT calculations
38–39
Three-dimensional axon tracking, brain connectivity reconstruction
802
Three-dimensional convolutions, BigDFT code
138–139
Three-dimensional DDA algorithm, photon transport
253
Three-dimensional lattice
direct Coulomb summation
48
GPU MO algorithms
10–11
Three-dimensional operators, and BigDFT code
140–143
Three-dimensional volume visualization, brain connectivity reconstruction
795–797
Thrust libraries
atlas construction
775–776
object detection
527 , 533–534
Tic-Tac-Toe dataset, AntMinerGPU evaluation
337–339
Tiled-shared memory
GPU MO algorithms
13–14
schematic representation
15
Tile Offset lookup table, B-spline registration
757–758
Tiles, B-spline registration
752 , 756–757 , 768–769
Tiling scheme, RNA folding algorithm
205–208
Time-dependent Schröedinger equation (TDSE), direct MD
60
Timing-constrained power optimization, fast circuit optimization
366
Total variation minimization (TVM), CT reconstruction performance
703
Training phase
object detection
537
Transition functions, template-driven agent-based modeling
314–315 , 317–321
Transmissive properties
plant rendering
391
plastics rendering
392–393
Tree-based data structures, Barnes Hut n -body algorithm
algorithm overview
76–77
basic problem
75–76
evaluation methodology
88–89
global optimizations
78–79
implementation limitations
91
implementation results
89–90
kernel 1 optimization
79–80
kernel 2 optimization
80–81
kernel 3 optimization
81–83
kernel 4 optimization
83
kernel 5 optimization
84–86
kernel 6 optimization
86
optimizations overview
86–88
Treecode calculations, fast n -body simulations
115–117 , 122–125
treediv, VSM
469–470
treetran, VSM
469–470
Triphone states, ASR
606–607
Twisted generalized feedback shift register (TGFSR)
237–242
Two-dimensional estimation, VSM
453
Two-pass elimination approach, temporal data mining
algorithmic enhancements
220–222
basic problem
219–220
performance evaluation
224–226
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.144.40.189