41,527
edits
Modules sse3: Difference between revisions
Jump to navigation
Jump to search
no edit summary
No edit summary Tag: Manual revert |
No edit summary |
||
| Line 417: | Line 417: | ||
| align="center" | [https://developer.nvidia.com/cudnn cudnn] | | align="center" | [https://developer.nvidia.com/cudnn cudnn] | ||
| align="center" | math | | align="center" | math | ||
| align="center" | 5.1, 6 | | align="center" | 5.1, 6.0, 7.6.5, 8.0.3, 8.2.0, 8.6.0.163, 8.7.0.84 | ||
| <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: The NVIDIA CUDA Deep Neural Network library (cuDNN) is a GPU-accelerated library of primitives for deep neural networks. Homepage: https://developer.nvidia.com/cudnn URL: https://developer.nvidia.com/cudnn Keyword:math<br /><br /><br /></div> | | <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: The NVIDIA CUDA Deep Neural Network library (cuDNN) is a GPU-accelerated library of primitives for deep neural networks. Homepage: https://developer.nvidia.com/cudnn URL: https://developer.nvidia.com/cudnn Keyword:math<br /><br /><br /></div> | ||
|- | |- | ||
| Line 2,024: | Line 2,024: | ||
| align="center" | 2015.2 | | align="center" | 2015.2 | ||
| <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. - Homepage: http://www.qhull.org Keyword:math<br /><br /><br /></div> | | <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. - Homepage: http://www.qhull.org Keyword:math<br /><br /><br /></div> | ||
|- | |||
| align="center" | [http://qiime2.org/ qiime2] | |||
| align="center" | - | |||
| align="center" | 2021.11 | |||
| <div class="mw-collapsible mw-collapsed" style="white-space: pre-line;"><br />Description: QIIME is an open-source bioinformatics pipeline for performing microbiome analysis from raw DNA sequencing data. Homepage: http://qiime2.org/ URL: http://qiime2.org/<br /><br /><br /></div> | |||
|- | |- | ||
| align="center" | [http://qjson.sourceforge.net/ qjson] | | align="center" | [http://qjson.sourceforge.net/ qjson] | ||