Results

Looking for more? ProQuest® Dissertations & Theses has additional dissertations and theses.
24871 open access dissertations and theses found for:
if(Fast algorithms)  »   Refine Search
1.
Fast Optimization Algorithms for AUC Maximization
by Natole, Michael, Jr., Ph.D.  State University of New York at Albany. 2020: 119 pages; 27835831.
2.
Graph diffusions and matrix functions: Fast algorithms and localization results
by Kloster, Kyle, Ph.D.  Purdue University. 2016: 114 pages; 10149739.
3.
Applications of the Minimum Sobolev Norm and Associated Fast Algorithms
by Gorman, Christopher Henry, Ph.D.  University of California, Santa Barbara. 2019: 220 pages; 13896728.
5.
Wait-free balanced search trees with fast readers
by Savoie, Lee Hilton, M.S.  The University of Texas at Dallas. 2009: 1 pages; 1484464.
6.
Efficient image restoration algorithms for near-circulant systems
by Pan, Ruimin, Ph.D.  Auburn University. 2007: 130 pages; 3265586.
7.
Fast modular exponentiation using residue domain representation: A hardware implementation and analysis
by Nguyen, Christopher Dinh, M.S.  University of Maryland, Baltimore County. 2013: 129 pages; 1551346.
8.
Topics in communication avoiding algorithms and stability analysis
by Lowery, Bradley R., Ph.D.  University of Colorado at Denver. 2014: 136 pages; 3621837.
9.
Provably Efficient Algorithms for Numerical Tensor Algebra
by Solomonik, Edgar, Ph.D.  University of California, Berkeley. 2014: 256 pages; 3686016.
11.
Fast convolutions with Helmholtz Green's functions and radially symmetric band -limited kernels
by Kurcz, Christopher, Ph.D.  University of Colorado at Boulder. 2008: 141 pages; 3303887.
12.
Implementation of fast modulated complex lapped transform on TMS320VC5416 DSP starter kit
by Shetge, Vaibhav R., M.S.  California State University, Long Beach. 2013: 92 pages; 1523083.
14.
Fast solvers and uncertainty quantification for models of magnetohydrodynamics
by Phillips, Edward G., Ph.D.  University of Maryland, College Park. 2014: 168 pages; 3644175.
15.
Efficient inference algorithms for near-deterministic systems
by Chatterjee, Shaunak, Ph.D.  University of California, Berkeley. 2013: 130 pages; 3616611.
16.
Any-angle path planning
by Nash, Alex, Ph.D.  University of Southern California. 2012: 433 pages; 3542296.
17.
Single-Molecule Localization Algorithms in Super-Resolution Microscopy
by Wolter, Steve, Ph.D.  Bayerische Julius-Maximilians-Universitaet Wuerzburg (Germany). 2015: 66 pages; 10720484.
18.
Force field development with GOMC, a fast new Monte Carlo molecular simulation code
by Mick, Jason Richard, Ph.D.  Wayne State University. 2016: 171 pages; 10105010.
19.
Towards Fast and Efficient Representation Learning
by Li, Hao, Ph.D.  University of Maryland, College Park. 2018: 147 pages; 10845690.
20.
Efficient algorithms for phylogenetic post-analysis
by Pattengale, Nicholas Dylan, Ph.D.  The University of New Mexico. 2010: 131 pages; 3409376.
21.
Algorithms in Elliptic Curve Cryptography
by Hutchinson, Aaron, Ph.D.  Florida Atlantic University. 2018: 148 pages; 10980188.
22.
Fast direct methods for molecular electrostatics
by Ho, Kenneth L., Ph.D.  New York University. 2012: 180 pages; 3524158.
23.
Algorithms for DNA Sequence Assembly and Motif Search
by Dinh, Hieu Trung, Ph.D.  University of Connecticut. 2012: 95 pages; 3533974.
24.
Reconfiguration of multiprocessor systems with spares using genetic algorithms
by Bollineni, Venugopal, M.S.  California State University, Long Beach. 2009: 50 pages; 1472282.
25.
Efficient primitives and algorithms for many-core architectures
by Sengupta, Shubhabrata, Ph.D.  University of California, Davis. 2010: 164 pages; 3444098.
26.
Randomized Fast Solvers for Linear and Nonlinear Problems in Data Science
by Wu, Huiwen, Ph.D.  University of California, Irvine. 2019: 151 pages; 27665431.
27.
Exact Primitives for Time Series Data Mining
by Mueen, Abdullah Al, Ph.D.  University of California, Riverside. 2012: 184 pages; 3503286.
28.
Fabbed to Sense: Integrated Design of Geometry and Sensing Algorithms for Interactive Objects
by Savage, Valkyrie Arline, Ph.D.  University of California, Berkeley. 2016: 129 pages; 10191122.
29.
An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing
by Scott, Jacob N., Ph.D.  University of California, Berkeley. 2015: 113 pages; 10086162.
30.
Stochastic Neural Algorithms
by Engler, Gary Ronald, Jr., Ph.D.  Stevens Institute of Technology. 2018: 161 pages; 10979690.
1 - 30 of 24871 displayed.
  1    2    3    4    5    6    7    8    9    10    11   Next >
Copyright © 2020 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest