Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Fast algorithms). Showing records 1 – 30 of 72 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Levels

▼ Search Limiters


University of Illinois – Chicago

1. Pappalardo, Alessandro. Fast Algorithm For Quantized Convolutional Neural Networks.

Degree: 2017, University of Illinois – Chicago

 Quantization has proven to be a powerful technique to reduce the memory footprint of Con volutional Neural Networks at inference time without sacrifying their accuracy.… (more)

Subjects/Keywords: convolution; quantization; deep learning; fast algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pappalardo, A. (2017). Fast Algorithm For Quantized Convolutional Neural Networks. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22062

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pappalardo, Alessandro. “Fast Algorithm For Quantized Convolutional Neural Networks.” 2017. Thesis, University of Illinois – Chicago. Accessed December 03, 2020. http://hdl.handle.net/10027/22062.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pappalardo, Alessandro. “Fast Algorithm For Quantized Convolutional Neural Networks.” 2017. Web. 03 Dec 2020.

Vancouver:

Pappalardo A. Fast Algorithm For Quantized Convolutional Neural Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10027/22062.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pappalardo A. Fast Algorithm For Quantized Convolutional Neural Networks. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/22062

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Syracuse University

2. Rautio, Brian J. The Unified-FFT Method for Fast Solution of Integral Equations as Applied to Shielded-Domain Electromagnetics.

Degree: PhD, Electrical Engineering and Computer Science, 2014, Syracuse University

  Electromagnetic (EM) solvers are widely used within computer-aided design (CAD) to improve and ensure success of circuit designs. Unfortunately, due to the complexity of… (more)

Subjects/Keywords: Computational Electromagnetics; Computational Methods; Fast Algorithms; Fast Methods; Method of Moments; Numerical Electromagnetics; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rautio, B. J. (2014). The Unified-FFT Method for Fast Solution of Integral Equations as Applied to Shielded-Domain Electromagnetics. (Doctoral Dissertation). Syracuse University. Retrieved from https://surface.syr.edu/etd/167

Chicago Manual of Style (16th Edition):

Rautio, Brian J. “The Unified-FFT Method for Fast Solution of Integral Equations as Applied to Shielded-Domain Electromagnetics.” 2014. Doctoral Dissertation, Syracuse University. Accessed December 03, 2020. https://surface.syr.edu/etd/167.

MLA Handbook (7th Edition):

Rautio, Brian J. “The Unified-FFT Method for Fast Solution of Integral Equations as Applied to Shielded-Domain Electromagnetics.” 2014. Web. 03 Dec 2020.

Vancouver:

Rautio BJ. The Unified-FFT Method for Fast Solution of Integral Equations as Applied to Shielded-Domain Electromagnetics. [Internet] [Doctoral dissertation]. Syracuse University; 2014. [cited 2020 Dec 03]. Available from: https://surface.syr.edu/etd/167.

Council of Science Editors:

Rautio BJ. The Unified-FFT Method for Fast Solution of Integral Equations as Applied to Shielded-Domain Electromagnetics. [Doctoral Dissertation]. Syracuse University; 2014. Available from: https://surface.syr.edu/etd/167


Boise State University

3. Shrestha, Anup. Massively Parallel Algorithm for Solving the Eikonal Equation on Multiple Accelerator Platforms.

Degree: 2016, Boise State University

 The research presented in this thesis investigates parallel implementations of the Fast Sweeping Method (FSM) for Graphics Processing Unit (GPU)-based computational plat forms and proposes… (more)

Subjects/Keywords: eikonal equation; distance field; fast sweeping method; algorithms; parallel computing; gpu computing; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shrestha, A. (2016). Massively Parallel Algorithm for Solving the Eikonal Equation on Multiple Accelerator Platforms. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1225

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shrestha, Anup. “Massively Parallel Algorithm for Solving the Eikonal Equation on Multiple Accelerator Platforms.” 2016. Thesis, Boise State University. Accessed December 03, 2020. https://scholarworks.boisestate.edu/td/1225.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shrestha, Anup. “Massively Parallel Algorithm for Solving the Eikonal Equation on Multiple Accelerator Platforms.” 2016. Web. 03 Dec 2020.

Vancouver:

Shrestha A. Massively Parallel Algorithm for Solving the Eikonal Equation on Multiple Accelerator Platforms. [Internet] [Thesis]. Boise State University; 2016. [cited 2020 Dec 03]. Available from: https://scholarworks.boisestate.edu/td/1225.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shrestha A. Massively Parallel Algorithm for Solving the Eikonal Equation on Multiple Accelerator Platforms. [Thesis]. Boise State University; 2016. Available from: https://scholarworks.boisestate.edu/td/1225

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas A&M University

4. Ghosh, Aditi. Fast Algorithms for Biharmonic Problems and Applications to Fluid Dynamics.

Degree: PhD, Mathematics, 2013, Texas A&M University

 Many areas of physics, engineering and applied mathematics require solutions of inhomogeneous biharmonic problems. For example, various problems on Stokes flow and elasticity can be… (more)

Subjects/Keywords: Biharmonic; Poisson; Biharmonic equation; Poisson equation; fast algorithms; fluid dynamics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghosh, A. (2013). Fast Algorithms for Biharmonic Problems and Applications to Fluid Dynamics. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151695

Chicago Manual of Style (16th Edition):

Ghosh, Aditi. “Fast Algorithms for Biharmonic Problems and Applications to Fluid Dynamics.” 2013. Doctoral Dissertation, Texas A&M University. Accessed December 03, 2020. http://hdl.handle.net/1969.1/151695.

MLA Handbook (7th Edition):

Ghosh, Aditi. “Fast Algorithms for Biharmonic Problems and Applications to Fluid Dynamics.” 2013. Web. 03 Dec 2020.

Vancouver:

Ghosh A. Fast Algorithms for Biharmonic Problems and Applications to Fluid Dynamics. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1969.1/151695.

Council of Science Editors:

Ghosh A. Fast Algorithms for Biharmonic Problems and Applications to Fluid Dynamics. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151695


University of Colorado

5. Lipinski, Douglas Martin. Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications.

Degree: PhD, Applied Mathematics, 2012, University of Colorado

  Lagrangian coherent structures (LCS) are recently defined structures used to analyze transport in dynamical systems with general time dependence. LCS techniques have seen increasing… (more)

Subjects/Keywords: dynamical systems; fast algorithms; Lagrangian coherent structures; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lipinski, D. M. (2012). Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/56

Chicago Manual of Style (16th Edition):

Lipinski, Douglas Martin. “Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications.” 2012. Doctoral Dissertation, University of Colorado. Accessed December 03, 2020. https://scholar.colorado.edu/appm_gradetds/56.

MLA Handbook (7th Edition):

Lipinski, Douglas Martin. “Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications.” 2012. Web. 03 Dec 2020.

Vancouver:

Lipinski DM. Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2020 Dec 03]. Available from: https://scholar.colorado.edu/appm_gradetds/56.

Council of Science Editors:

Lipinski DM. Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/appm_gradetds/56


University of Manitoba

6. Aronsson, Jonatan. Novel tree-based algorithms for computational electromagnetics.

Degree: Electrical and Computer Engineering, 2010, University of Manitoba

 Tree-based methods have wide applications for solving large-scale problems in electromagnetics, astrophysics, quantum chemistry, fluid mechanics, acoustics, and many more areas. This thesis focuses on… (more)

Subjects/Keywords: electromagnetics; tree-based algorithms; Barnes-Hut; Fast Multipole Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Aronsson, J. (2010). Novel tree-based algorithms for computational electromagnetics. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/22086

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Aronsson, Jonatan. “Novel tree-based algorithms for computational electromagnetics.” 2010. Thesis, University of Manitoba. Accessed December 03, 2020. http://hdl.handle.net/1993/22086.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Aronsson, Jonatan. “Novel tree-based algorithms for computational electromagnetics.” 2010. Web. 03 Dec 2020.

Vancouver:

Aronsson J. Novel tree-based algorithms for computational electromagnetics. [Internet] [Thesis]. University of Manitoba; 2010. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/1993/22086.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aronsson J. Novel tree-based algorithms for computational electromagnetics. [Thesis]. University of Manitoba; 2010. Available from: http://hdl.handle.net/1993/22086

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

7. Sarathy, Aditya. Fast algorithms for small particle scattering problems.

Degree: MS, 1200, 2014, University of Illinois – Urbana-Champaign

 In scattering problems, commonly used techniques are surface and volume integral equations. Discrete dipole approximation (DDA) is an alternate and useful discretization technique to solve… (more)

Subjects/Keywords: Method of Moments; Computational Electromagnetics; Fast Multipole Method; Matrix Projection Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sarathy, A. (2014). Fast algorithms for small particle scattering problems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50498

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sarathy, Aditya. “Fast algorithms for small particle scattering problems.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed December 03, 2020. http://hdl.handle.net/2142/50498.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sarathy, Aditya. “Fast algorithms for small particle scattering problems.” 2014. Web. 03 Dec 2020.

Vancouver:

Sarathy A. Fast algorithms for small particle scattering problems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2142/50498.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sarathy A. Fast algorithms for small particle scattering problems. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50498

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Kabacaoğlu, Gökberk. Numerical methods for simulations and optimization of vesicle flows in microfluidic devices.

Degree: PhD, Mechanical Engineering, 2019, University of Texas – Austin

 Vesicles are highly deformable particles that are filled with a Newtonian fluid. They resemble biological cells without a nucleus such as red blood cells (RBCs).… (more)

Subjects/Keywords: Computational biology; Fluid dynamics; Fast algorithms; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kabacaoğlu, G. (2019). Numerical methods for simulations and optimization of vesicle flows in microfluidic devices. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2875

Chicago Manual of Style (16th Edition):

Kabacaoğlu, Gökberk. “Numerical methods for simulations and optimization of vesicle flows in microfluidic devices.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed December 03, 2020. http://dx.doi.org/10.26153/tsw/2875.

MLA Handbook (7th Edition):

Kabacaoğlu, Gökberk. “Numerical methods for simulations and optimization of vesicle flows in microfluidic devices.” 2019. Web. 03 Dec 2020.

Vancouver:

Kabacaoğlu G. Numerical methods for simulations and optimization of vesicle flows in microfluidic devices. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2020 Dec 03]. Available from: http://dx.doi.org/10.26153/tsw/2875.

Council of Science Editors:

Kabacaoğlu G. Numerical methods for simulations and optimization of vesicle flows in microfluidic devices. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2875


University of Montana

9. Pulavarty, S. V. An estimation of distribution algorithm based on linkage discovery and factorization.

Degree: MS, 2005, University of Montana

Subjects/Keywords: Algorithms.; Probabilities.; Algorithms. fast (OCoLC)fst00805020; Probabilities. fast (OCoLC)fst01077737

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pulavarty, S. V. (2005). An estimation of distribution algorithm based on linkage discovery and factorization. (Masters Thesis). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/8347

Chicago Manual of Style (16th Edition):

Pulavarty, S V. “An estimation of distribution algorithm based on linkage discovery and factorization.” 2005. Masters Thesis, University of Montana. Accessed December 03, 2020. https://scholarworks.umt.edu/etd/8347.

MLA Handbook (7th Edition):

Pulavarty, S V. “An estimation of distribution algorithm based on linkage discovery and factorization.” 2005. Web. 03 Dec 2020.

Vancouver:

Pulavarty SV. An estimation of distribution algorithm based on linkage discovery and factorization. [Internet] [Masters thesis]. University of Montana; 2005. [cited 2020 Dec 03]. Available from: https://scholarworks.umt.edu/etd/8347.

Council of Science Editors:

Pulavarty SV. An estimation of distribution algorithm based on linkage discovery and factorization. [Masters Thesis]. University of Montana; 2005. Available from: https://scholarworks.umt.edu/etd/8347


University of Montana

10. Wang, Shengping. Breeder algorithm for stellarator optimization.

Degree: MS, 2004, University of Montana

Subjects/Keywords: Stellarators.; Algorithms.; Algorithms. fast (OCoLC)fst00805020; Stellarators. fast (OCoLC)fst01132962

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, S. (2004). Breeder algorithm for stellarator optimization. (Masters Thesis). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/5127

Chicago Manual of Style (16th Edition):

Wang, Shengping. “Breeder algorithm for stellarator optimization.” 2004. Masters Thesis, University of Montana. Accessed December 03, 2020. https://scholarworks.umt.edu/etd/5127.

MLA Handbook (7th Edition):

Wang, Shengping. “Breeder algorithm for stellarator optimization.” 2004. Web. 03 Dec 2020.

Vancouver:

Wang S. Breeder algorithm for stellarator optimization. [Internet] [Masters thesis]. University of Montana; 2004. [cited 2020 Dec 03]. Available from: https://scholarworks.umt.edu/etd/5127.

Council of Science Editors:

Wang S. Breeder algorithm for stellarator optimization. [Masters Thesis]. University of Montana; 2004. Available from: https://scholarworks.umt.edu/etd/5127


University of Montana

11. Bao, Yuanzhen. Range analysis of variables within a program.

Degree: MS, 2006, University of Montana

Subjects/Keywords: Variables (Mathematics); Algorithms.; Algorithms. fast (OCoLC)fst00805020; Variables (Mathematics) fast (OCoLC)fst01164184

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bao, Y. (2006). Range analysis of variables within a program. (Masters Thesis). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/8034

Chicago Manual of Style (16th Edition):

Bao, Yuanzhen. “Range analysis of variables within a program.” 2006. Masters Thesis, University of Montana. Accessed December 03, 2020. https://scholarworks.umt.edu/etd/8034.

MLA Handbook (7th Edition):

Bao, Yuanzhen. “Range analysis of variables within a program.” 2006. Web. 03 Dec 2020.

Vancouver:

Bao Y. Range analysis of variables within a program. [Internet] [Masters thesis]. University of Montana; 2006. [cited 2020 Dec 03]. Available from: https://scholarworks.umt.edu/etd/8034.

Council of Science Editors:

Bao Y. Range analysis of variables within a program. [Masters Thesis]. University of Montana; 2006. Available from: https://scholarworks.umt.edu/etd/8034


Indian Institute of Science

12. Kala, S. ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor.

Degree: MSc Engg, Faculty of Engineering, 2016, Indian Institute of Science

 The rapid advancements in semiconductor technology have led to constant shrinking of transistor sizes as per Moore's Law. Wireless communications is one field which has… (more)

Subjects/Keywords: Wireless Communication Systems; Fast Fourier Transformation Processor; Fast Fourier Transform Archirecture; Fast Fourier Transform - Algorithms; Application Specific Integrated Circuit; FFT Processor; FFT Architecture; Orthogonal Frequency Division Multiplexing (OFDM); Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kala, S. (2016). ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2557

Chicago Manual of Style (16th Edition):

Kala, S. “ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor.” 2016. Masters Thesis, Indian Institute of Science. Accessed December 03, 2020. http://etd.iisc.ac.in/handle/2005/2557.

MLA Handbook (7th Edition):

Kala, S. “ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor.” 2016. Web. 03 Dec 2020.

Vancouver:

Kala S. ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor. [Internet] [Masters thesis]. Indian Institute of Science; 2016. [cited 2020 Dec 03]. Available from: http://etd.iisc.ac.in/handle/2005/2557.

Council of Science Editors:

Kala S. ASIC Implementation of A High Throughput, Low Latency, Memory Optimized FFT Processor. [Masters Thesis]. Indian Institute of Science; 2016. Available from: http://etd.iisc.ac.in/handle/2005/2557


Halmstad University

13. Hast, Andreas. Fast Factorized Back-Pro jection in an FPGA.

Degree: Computer and Electrical Engineering (IDE), 2006, Halmstad University

  The Fast Factorized Back Pro jection (FFBP) algorithm is a computationally efficient algorithm for image formation in a Very High Frequency Synthetic Aperture Radar… (more)

Subjects/Keywords: Fast Factorized Back Projection; FFBP; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hast, A. (2006). Fast Factorized Back-Pro jection in an FPGA. (Thesis). Halmstad University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-280

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hast, Andreas. “Fast Factorized Back-Pro jection in an FPGA.” 2006. Thesis, Halmstad University. Accessed December 03, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-280.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hast, Andreas. “Fast Factorized Back-Pro jection in an FPGA.” 2006. Web. 03 Dec 2020.

Vancouver:

Hast A. Fast Factorized Back-Pro jection in an FPGA. [Internet] [Thesis]. Halmstad University; 2006. [cited 2020 Dec 03]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-280.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hast A. Fast Factorized Back-Pro jection in an FPGA. [Thesis]. Halmstad University; 2006. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-280

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Arizona State University

14. Zhang, Lisha. Fast Numerical Algorithms for 3-D Scattering from PEC and Dielectric Random Rough Surfaces in Microwave Remote Sensing.

Degree: Electrical Engineering, 2016, Arizona State University

 We present fast and robust numerical algorithms for 3-D scattering from perfectly electrical conducting (PEC) and dielectric random rough surfaces in microwave remote sensing. The… (more)

Subjects/Keywords: Electromagnetics; Coifman wavelets; Fast wavelet transform; Method of moments; Numerical algorithms; Random rough surface; Scattering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhang, L. (2016). Fast Numerical Algorithms for 3-D Scattering from PEC and Dielectric Random Rough Surfaces in Microwave Remote Sensing. (Doctoral Dissertation). Arizona State University. Retrieved from http://repository.asu.edu/items/38433

Chicago Manual of Style (16th Edition):

Zhang, Lisha. “Fast Numerical Algorithms for 3-D Scattering from PEC and Dielectric Random Rough Surfaces in Microwave Remote Sensing.” 2016. Doctoral Dissertation, Arizona State University. Accessed December 03, 2020. http://repository.asu.edu/items/38433.

MLA Handbook (7th Edition):

Zhang, Lisha. “Fast Numerical Algorithms for 3-D Scattering from PEC and Dielectric Random Rough Surfaces in Microwave Remote Sensing.” 2016. Web. 03 Dec 2020.

Vancouver:

Zhang L. Fast Numerical Algorithms for 3-D Scattering from PEC and Dielectric Random Rough Surfaces in Microwave Remote Sensing. [Internet] [Doctoral dissertation]. Arizona State University; 2016. [cited 2020 Dec 03]. Available from: http://repository.asu.edu/items/38433.

Council of Science Editors:

Zhang L. Fast Numerical Algorithms for 3-D Scattering from PEC and Dielectric Random Rough Surfaces in Microwave Remote Sensing. [Doctoral Dissertation]. Arizona State University; 2016. Available from: http://repository.asu.edu/items/38433


University of Texas – Austin

15. Yu, Chen-Han, Ph. D. The science of high performance algorithms for hierarchical matrices.

Degree: PhD, Computer Science, 2018, University of Texas – Austin

 Many matrices in scientific computing, statistical inference, and machine learning exhibit sparse and low-rank structure. Typically, such structure is exposed by appropriate matrix permutation of… (more)

Subjects/Keywords: Hierarchical matrices; Fast multipole methods; Kernel methods; Parallel algorithms; High-performance computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yu, Chen-Han, P. D. (2018). The science of high performance algorithms for hierarchical matrices. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68459

Chicago Manual of Style (16th Edition):

Yu, Chen-Han, Ph D. “The science of high performance algorithms for hierarchical matrices.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed December 03, 2020. http://hdl.handle.net/2152/68459.

MLA Handbook (7th Edition):

Yu, Chen-Han, Ph D. “The science of high performance algorithms for hierarchical matrices.” 2018. Web. 03 Dec 2020.

Vancouver:

Yu, Chen-Han PD. The science of high performance algorithms for hierarchical matrices. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2152/68459.

Council of Science Editors:

Yu, Chen-Han PD. The science of high performance algorithms for hierarchical matrices. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68459


University of Florida

16. Current, Karl Wayne, 1949-. Optimization of nonlinear periodic circuits.

Degree: 1974, University of Florida

Subjects/Keywords: Algorithms; Electric circuits; Nonlinear programming; Electric network analyzers; Electrical Engineering thesis Ph. D; Algorithms. ( fast ); Electric circuits. ( fast ); Electric network analyzers. ( fast ); Nonlinear programming. ( fast )

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Current, Karl Wayne, 1. (1974). Optimization of nonlinear periodic circuits. (Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/AA00064637

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Current, Karl Wayne, 1949-. “Optimization of nonlinear periodic circuits.” 1974. Thesis, University of Florida. Accessed December 03, 2020. https://ufdc.ufl.edu/AA00064637.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Current, Karl Wayne, 1949-. “Optimization of nonlinear periodic circuits.” 1974. Web. 03 Dec 2020.

Vancouver:

Current, Karl Wayne 1. Optimization of nonlinear periodic circuits. [Internet] [Thesis]. University of Florida; 1974. [cited 2020 Dec 03]. Available from: https://ufdc.ufl.edu/AA00064637.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Current, Karl Wayne 1. Optimization of nonlinear periodic circuits. [Thesis]. University of Florida; 1974. Available from: https://ufdc.ufl.edu/AA00064637

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Sul

17. Palomino, Daniel Munari Vilchez. Algorithm and hardware based architectural design targeting the intra-frame prediction of the HEVC video coding standard.

Degree: 2013, Universidade do Rio Grande do Sul

Este trabalho apresenta uma arquitetura de hardware para a predição intra-quadro do padrão emergente HEVC de codificação de vídeo. O padrão HEVC está sendo desenvolvido… (more)

Subjects/Keywords: Hardware design; Microeletrônica; Video coding; Vlsi : Circuitos integrados : Eletronica; Compressao : Video; Intra-frame prediction; HEVC; Mode decision; Fast algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Palomino, D. M. V. (2013). Algorithm and hardware based architectural design targeting the intra-frame prediction of the HEVC video coding standard. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/70236

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Palomino, Daniel Munari Vilchez. “Algorithm and hardware based architectural design targeting the intra-frame prediction of the HEVC video coding standard.” 2013. Thesis, Universidade do Rio Grande do Sul. Accessed December 03, 2020. http://hdl.handle.net/10183/70236.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Palomino, Daniel Munari Vilchez. “Algorithm and hardware based architectural design targeting the intra-frame prediction of the HEVC video coding standard.” 2013. Web. 03 Dec 2020.

Vancouver:

Palomino DMV. Algorithm and hardware based architectural design targeting the intra-frame prediction of the HEVC video coding standard. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2013. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10183/70236.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Palomino DMV. Algorithm and hardware based architectural design targeting the intra-frame prediction of the HEVC video coding standard. [Thesis]. Universidade do Rio Grande do Sul; 2013. Available from: http://hdl.handle.net/10183/70236

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Michigan

18. Liu, Yang. Solving Electrically Very Large Transient Electromagnetic Problems Using Plane-Wave Time-Domain Algorithms.

Degree: PhD, Electrical Engineering, 2015, University of Michigan

 The marching-on-in-time (MOT)-based time domain integral equation solvers provide an appealing avenue for solving transient electromagnetic scattering/radiation problems. These state-of-the-art solvers are high-order accurate, rapidly… (more)

Subjects/Keywords: transient scattering; fast algorithms; time domain integral equation; plane-wave time-domain algorithm; parallelization; computational electromagnetics; Electrical Engineering; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Liu, Y. (2015). Solving Electrically Very Large Transient Electromagnetic Problems Using Plane-Wave Time-Domain Algorithms. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/113642

Chicago Manual of Style (16th Edition):

Liu, Yang. “Solving Electrically Very Large Transient Electromagnetic Problems Using Plane-Wave Time-Domain Algorithms.” 2015. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/113642.

MLA Handbook (7th Edition):

Liu, Yang. “Solving Electrically Very Large Transient Electromagnetic Problems Using Plane-Wave Time-Domain Algorithms.” 2015. Web. 03 Dec 2020.

Vancouver:

Liu Y. Solving Electrically Very Large Transient Electromagnetic Problems Using Plane-Wave Time-Domain Algorithms. [Internet] [Doctoral dissertation]. University of Michigan; 2015. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/113642.

Council of Science Editors:

Liu Y. Solving Electrically Very Large Transient Electromagnetic Problems Using Plane-Wave Time-Domain Algorithms. [Doctoral Dissertation]. University of Michigan; 2015. Available from: http://hdl.handle.net/2027.42/113642


University of Michigan

19. Bindiganavale, Sunil S. Fast memory-saving hybrid algorithms for electromagnetic scattering and radiation.

Degree: PhD, Electrical engineering, 1997, University of Michigan

 The main theme in this dissertation is examination of techniques for alleviating the excessive memory requirement and execution time associated with implementations of popular frequency… (more)

Subjects/Keywords: Algorithms; Electromagnetic Radiation; Fast; Hybrid; Memory; Saving; Scatteri; Scattering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bindiganavale, S. S. (1997). Fast memory-saving hybrid algorithms for electromagnetic scattering and radiation. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/130660

Chicago Manual of Style (16th Edition):

Bindiganavale, Sunil S. “Fast memory-saving hybrid algorithms for electromagnetic scattering and radiation.” 1997. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/130660.

MLA Handbook (7th Edition):

Bindiganavale, Sunil S. “Fast memory-saving hybrid algorithms for electromagnetic scattering and radiation.” 1997. Web. 03 Dec 2020.

Vancouver:

Bindiganavale SS. Fast memory-saving hybrid algorithms for electromagnetic scattering and radiation. [Internet] [Doctoral dissertation]. University of Michigan; 1997. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/130660.

Council of Science Editors:

Bindiganavale SS. Fast memory-saving hybrid algorithms for electromagnetic scattering and radiation. [Doctoral Dissertation]. University of Michigan; 1997. Available from: http://hdl.handle.net/2027.42/130660


University of Western Ontario

20. Pan, Wei. Algorithmic Contributions to the Theory of Regular Chains.

Degree: 2011, University of Western Ontario

 Regular chains, introduced about twenty years ago, have emerged as one of the major tools for solving polynomial systems symbolically. In this thesis, we focus… (more)

Subjects/Keywords: symbolic computation; regular chain; regular GCD; subresultant; fast Fourier transform; GPU computing; Other Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pan, W. (2011). Algorithmic Contributions to the Theory of Regular Chains. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/80

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pan, Wei. “Algorithmic Contributions to the Theory of Regular Chains.” 2011. Thesis, University of Western Ontario. Accessed December 03, 2020. https://ir.lib.uwo.ca/etd/80.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pan, Wei. “Algorithmic Contributions to the Theory of Regular Chains.” 2011. Web. 03 Dec 2020.

Vancouver:

Pan W. Algorithmic Contributions to the Theory of Regular Chains. [Internet] [Thesis]. University of Western Ontario; 2011. [cited 2020 Dec 03]. Available from: https://ir.lib.uwo.ca/etd/80.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pan W. Algorithmic Contributions to the Theory of Regular Chains. [Thesis]. University of Western Ontario; 2011. Available from: https://ir.lib.uwo.ca/etd/80

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

21. David, Theodoros P. Networking Requirements and Solutions for a TV WWW Browser.

Degree: MS, Electrical Engineering, 1997, Virginia Tech

  Most people cannot access the World Wide Web (WWW) and other Internet services because access requires a complex and expensive computer. Moreover, the bandwidth… (more)

Subjects/Keywords: fast ethernet; asymmetric networks; TV Browser; WWW; distribution algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

David, T. P. (1997). Networking Requirements and Solutions for a TV WWW Browser. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36994

Chicago Manual of Style (16th Edition):

David, Theodoros P. “Networking Requirements and Solutions for a TV WWW Browser.” 1997. Masters Thesis, Virginia Tech. Accessed December 03, 2020. http://hdl.handle.net/10919/36994.

MLA Handbook (7th Edition):

David, Theodoros P. “Networking Requirements and Solutions for a TV WWW Browser.” 1997. Web. 03 Dec 2020.

Vancouver:

David TP. Networking Requirements and Solutions for a TV WWW Browser. [Internet] [Masters thesis]. Virginia Tech; 1997. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/10919/36994.

Council of Science Editors:

David TP. Networking Requirements and Solutions for a TV WWW Browser. [Masters Thesis]. Virginia Tech; 1997. Available from: http://hdl.handle.net/10919/36994

22. Wen, Zhaofang. Fast Parallel Algorithms for Basic Problems.

Degree: PhD, Computer Science, 1991, Old Dominion University

  Parallel processing is one of the most active research areas these days. We are interested in one aspect of parallel processing, i.e. the design… (more)

Subjects/Keywords: Parallel algorithms; Basic problems; Fast; Parallel processing; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wen, Z. (1991). Fast Parallel Algorithms for Basic Problems. (Doctoral Dissertation). Old Dominion University. Retrieved from https://digitalcommons.odu.edu/computerscience_etds/120

Chicago Manual of Style (16th Edition):

Wen, Zhaofang. “Fast Parallel Algorithms for Basic Problems.” 1991. Doctoral Dissertation, Old Dominion University. Accessed December 03, 2020. https://digitalcommons.odu.edu/computerscience_etds/120.

MLA Handbook (7th Edition):

Wen, Zhaofang. “Fast Parallel Algorithms for Basic Problems.” 1991. Web. 03 Dec 2020.

Vancouver:

Wen Z. Fast Parallel Algorithms for Basic Problems. [Internet] [Doctoral dissertation]. Old Dominion University; 1991. [cited 2020 Dec 03]. Available from: https://digitalcommons.odu.edu/computerscience_etds/120.

Council of Science Editors:

Wen Z. Fast Parallel Algorithms for Basic Problems. [Doctoral Dissertation]. Old Dominion University; 1991. Available from: https://digitalcommons.odu.edu/computerscience_etds/120


Georgia State University

23. Johnson, Paul D. Factorization of Quasiseparable Matrices.

Degree: MS, Mathematics and Statistics, 2008, Georgia State University

 This paper investigates some of the ideas and algorithms developed for exploiting the structure of quasiseparable matrices. The case of purely scalar generators is considered… (more)

Subjects/Keywords: QR factorization; fast algorithms; quasiseparable matrices; structure matrices; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Johnson, P. D. (2008). Factorization of Quasiseparable Matrices. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_theses/65

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Johnson, Paul D. “Factorization of Quasiseparable Matrices.” 2008. Thesis, Georgia State University. Accessed December 03, 2020. https://scholarworks.gsu.edu/math_theses/65.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Johnson, Paul D. “Factorization of Quasiseparable Matrices.” 2008. Web. 03 Dec 2020.

Vancouver:

Johnson PD. Factorization of Quasiseparable Matrices. [Internet] [Thesis]. Georgia State University; 2008. [cited 2020 Dec 03]. Available from: https://scholarworks.gsu.edu/math_theses/65.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Johnson PD. Factorization of Quasiseparable Matrices. [Thesis]. Georgia State University; 2008. Available from: https://scholarworks.gsu.edu/math_theses/65

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Florida International University

24. Xu, Shuai. A New Study of Applying Complexity Theoretical Tools in Algorithm Design.

Degree: PhD, Computer Science, 2019, Florida International University

  Given n vectors with dimension m in Boolean domain, how to find two vectors whose pairwise Hamming distance is minimum? This problem is known… (more)

Subjects/Keywords: Algorithm Design; Randomized Algorithm; Combinatorial Search; Error Correction Code; Fast Matrix Multiplication; Discrete Mathematics and Combinatorics; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xu, S. (2019). A New Study of Applying Complexity Theoretical Tools in Algorithm Design. (Doctoral Dissertation). Florida International University. Retrieved from https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791

Chicago Manual of Style (16th Edition):

Xu, Shuai. “A New Study of Applying Complexity Theoretical Tools in Algorithm Design.” 2019. Doctoral Dissertation, Florida International University. Accessed December 03, 2020. https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791.

MLA Handbook (7th Edition):

Xu, Shuai. “A New Study of Applying Complexity Theoretical Tools in Algorithm Design.” 2019. Web. 03 Dec 2020.

Vancouver:

Xu S. A New Study of Applying Complexity Theoretical Tools in Algorithm Design. [Internet] [Doctoral dissertation]. Florida International University; 2019. [cited 2020 Dec 03]. Available from: https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791.

Council of Science Editors:

Xu S. A New Study of Applying Complexity Theoretical Tools in Algorithm Design. [Doctoral Dissertation]. Florida International University; 2019. Available from: https://digitalcommons.fiu.edu/etd/4242 ; FIDC007791


University of Texas – Austin

25. Schmitz, Phillip Gordon. Fast direct algorithms for elliptic equations via hierarchical matrix compression.

Degree: PhD, Mathematics, 2010, University of Texas – Austin

 We present a fast direct algorithm for the solution of linear systems arising from elliptic equations. We extend the work of Xia et al. (2009)… (more)

Subjects/Keywords: Fast algorithms; Hierarchical matrices; Sparse; Direct; Elliptic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schmitz, P. G. (2010). Fast direct algorithms for elliptic equations via hierarchical matrix compression. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1847

Chicago Manual of Style (16th Edition):

Schmitz, Phillip Gordon. “Fast direct algorithms for elliptic equations via hierarchical matrix compression.” 2010. Doctoral Dissertation, University of Texas – Austin. Accessed December 03, 2020. http://hdl.handle.net/2152/ETD-UT-2010-08-1847.

MLA Handbook (7th Edition):

Schmitz, Phillip Gordon. “Fast direct algorithms for elliptic equations via hierarchical matrix compression.” 2010. Web. 03 Dec 2020.

Vancouver:

Schmitz PG. Fast direct algorithms for elliptic equations via hierarchical matrix compression. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2010. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1847.

Council of Science Editors:

Schmitz PG. Fast direct algorithms for elliptic equations via hierarchical matrix compression. [Doctoral Dissertation]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1847


University of Florida

26. Riesco, Armando, 1943-. A partitioning algorithm for separable convex mixed integer programming.

Degree: 1970, University of Florida

Subjects/Keywords: Algorithms; Programming (Mathematics); Industrial and Systems Engineering thesis Ph. D; Algorithms. ( fast ); Programming (Mathematics) ( fast )

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Riesco, Armando, 1. (1970). A partitioning algorithm for separable convex mixed integer programming. (Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/AA00067411

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Riesco, Armando, 1943-. “A partitioning algorithm for separable convex mixed integer programming.” 1970. Thesis, University of Florida. Accessed December 03, 2020. https://ufdc.ufl.edu/AA00067411.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Riesco, Armando, 1943-. “A partitioning algorithm for separable convex mixed integer programming.” 1970. Web. 03 Dec 2020.

Vancouver:

Riesco, Armando 1. A partitioning algorithm for separable convex mixed integer programming. [Internet] [Thesis]. University of Florida; 1970. [cited 2020 Dec 03]. Available from: https://ufdc.ufl.edu/AA00067411.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Riesco, Armando 1. A partitioning algorithm for separable convex mixed integer programming. [Thesis]. University of Florida; 1970. Available from: https://ufdc.ufl.edu/AA00067411

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Florida

27. Villa, Carlos Domingo, 1946-. Multi-product assembly line balancing.

Degree: 1970, University of Florida

Subjects/Keywords: Assembly-line methods; Algorithms; Industrial and Systems Engineering thesis Ph. D; Algorithms. ( fast ); Assembly-line methods. ( fast ); Fließfertigung  – Mathematische Optimierung  – Theorie.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Villa, Carlos Domingo, 1. (1970). Multi-product assembly line balancing. (Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/AA00064634

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Villa, Carlos Domingo, 1946-. “Multi-product assembly line balancing.” 1970. Thesis, University of Florida. Accessed December 03, 2020. https://ufdc.ufl.edu/AA00064634.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Villa, Carlos Domingo, 1946-. “Multi-product assembly line balancing.” 1970. Web. 03 Dec 2020.

Vancouver:

Villa, Carlos Domingo 1. Multi-product assembly line balancing. [Internet] [Thesis]. University of Florida; 1970. [cited 2020 Dec 03]. Available from: https://ufdc.ufl.edu/AA00064634.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Villa, Carlos Domingo 1. Multi-product assembly line balancing. [Thesis]. University of Florida; 1970. Available from: https://ufdc.ufl.edu/AA00064634

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Montana

28. Long, Yi. Crossover helps genetic algorithms in non-stationary environment.

Degree: MS, 2004, University of Montana

Subjects/Keywords: Genetic algorithms.; Genetic recombination.; Population genetics Mathematical models.; Genetic algorithms. fast (OCoLC)fst00939996; Genetic recombination. fast (OCoLC)fst00940079; Population genetics Mathematical models. fast (OCoLC)fst01071586

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Long, Y. (2004). Crossover helps genetic algorithms in non-stationary environment. (Masters Thesis). University of Montana. Retrieved from https://scholarworks.umt.edu/etd/5549

Chicago Manual of Style (16th Edition):

Long, Yi. “Crossover helps genetic algorithms in non-stationary environment.” 2004. Masters Thesis, University of Montana. Accessed December 03, 2020. https://scholarworks.umt.edu/etd/5549.

MLA Handbook (7th Edition):

Long, Yi. “Crossover helps genetic algorithms in non-stationary environment.” 2004. Web. 03 Dec 2020.

Vancouver:

Long Y. Crossover helps genetic algorithms in non-stationary environment. [Internet] [Masters thesis]. University of Montana; 2004. [cited 2020 Dec 03]. Available from: https://scholarworks.umt.edu/etd/5549.

Council of Science Editors:

Long Y. Crossover helps genetic algorithms in non-stationary environment. [Masters Thesis]. University of Montana; 2004. Available from: https://scholarworks.umt.edu/etd/5549


University of Michigan

29. Joshi, Rajashri Rajaram. Multiresolution fast algorithms for one-dimensional inverse scattering and linear least-squares estimation.

Degree: PhD, Pure Sciences, 1997, University of Michigan

 The Krein integral equation of one-dimensional (1-D) inverse scattering and the Wiener-Hopf integral equation of linear least-squares estimation are Fredholm equations with a symmetric Toeplitz… (more)

Subjects/Keywords: Algorithms; Dimensional; Estimation; Fast; Inverse Scattering; Least; Linear; Multiresolution; One; Scat; Squares; Wavelets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Joshi, R. R. (1997). Multiresolution fast algorithms for one-dimensional inverse scattering and linear least-squares estimation. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/130505

Chicago Manual of Style (16th Edition):

Joshi, Rajashri Rajaram. “Multiresolution fast algorithms for one-dimensional inverse scattering and linear least-squares estimation.” 1997. Doctoral Dissertation, University of Michigan. Accessed December 03, 2020. http://hdl.handle.net/2027.42/130505.

MLA Handbook (7th Edition):

Joshi, Rajashri Rajaram. “Multiresolution fast algorithms for one-dimensional inverse scattering and linear least-squares estimation.” 1997. Web. 03 Dec 2020.

Vancouver:

Joshi RR. Multiresolution fast algorithms for one-dimensional inverse scattering and linear least-squares estimation. [Internet] [Doctoral dissertation]. University of Michigan; 1997. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/2027.42/130505.

Council of Science Editors:

Joshi RR. Multiresolution fast algorithms for one-dimensional inverse scattering and linear least-squares estimation. [Doctoral Dissertation]. University of Michigan; 1997. Available from: http://hdl.handle.net/2027.42/130505


Brno University of Technology

30. Marton, Dominik. Akcelerace kompresního algoritmu LZ4 v FPGA: Acceleration of LZ4 Compression Algorithm in FPGA.

Degree: 2019, Brno University of Technology

 This project describes the implementation of an LZ4 compression algorithm in a C/C++-like language, that can be used to generate VHDL programs for FPGA integrated… (more)

Subjects/Keywords: rychlá bezeztrátová komprese; LZ4; slovníkové kompresní algoritmy; FPGA; Catapult; high-level syntéza; fast lossless compression; LZ4; dictionary-based compression algorithms; FPGA; Catapult; high-level synthesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Marton, D. (2019). Akcelerace kompresního algoritmu LZ4 v FPGA: Acceleration of LZ4 Compression Algorithm in FPGA. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/69575

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Marton, Dominik. “Akcelerace kompresního algoritmu LZ4 v FPGA: Acceleration of LZ4 Compression Algorithm in FPGA.” 2019. Thesis, Brno University of Technology. Accessed December 03, 2020. http://hdl.handle.net/11012/69575.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Marton, Dominik. “Akcelerace kompresního algoritmu LZ4 v FPGA: Acceleration of LZ4 Compression Algorithm in FPGA.” 2019. Web. 03 Dec 2020.

Vancouver:

Marton D. Akcelerace kompresního algoritmu LZ4 v FPGA: Acceleration of LZ4 Compression Algorithm in FPGA. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Dec 03]. Available from: http://hdl.handle.net/11012/69575.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marton D. Akcelerace kompresního algoritmu LZ4 v FPGA: Acceleration of LZ4 Compression Algorithm in FPGA. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/69575

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3]

.