Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Iterative algorithms)`

.
Showing records 1 – 30 of
80 total matches.

Search Limiters

Dates

- 2017 – 2021 (23)
- 2012 – 2016 (25)
- 2007 – 2011 (23)

▼ Search Limiters

University of New South Wales

1. Allah Bakhsh, Mohammad. Robust ranking and unfairness detection in social rating systems.

Degree: Computer Science & Engineering, 2013, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/52881 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11559/SOURCE01?view=true

► Using Web 2.0 technologies, people can collaboratively create content, share with others, build social networks, play online games and perform many more forms of collaboration…
(more)

Subjects/Keywords: Iterative algorithms; Robust Rating; Ranking

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Allah Bakhsh, M. (2013). Robust ranking and unfairness detection in social rating systems. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52881 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11559/SOURCE01?view=true

Chicago Manual of Style (16^{th} Edition):

Allah Bakhsh, Mohammad. “Robust ranking and unfairness detection in social rating systems.” 2013. Doctoral Dissertation, University of New South Wales. Accessed May 08, 2021. http://handle.unsw.edu.au/1959.4/52881 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11559/SOURCE01?view=true.

MLA Handbook (7^{th} Edition):

Allah Bakhsh, Mohammad. “Robust ranking and unfairness detection in social rating systems.” 2013. Web. 08 May 2021.

Vancouver:

Allah Bakhsh M. Robust ranking and unfairness detection in social rating systems. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2021 May 08]. Available from: http://handle.unsw.edu.au/1959.4/52881 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11559/SOURCE01?view=true.

Council of Science Editors:

Allah Bakhsh M. Robust ranking and unfairness detection in social rating systems. [Doctoral Dissertation]. University of New South Wales; 2013. Available from: http://handle.unsw.edu.au/1959.4/52881 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11559/SOURCE01?view=true

Hong Kong University of Science and Technology

2.
Chen, Junting.
Design and analysis of *iterative* *algorithms* via nonlinear control theory.

Degree: 2015, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-76119 ; https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/1/th_redirect.html

► Efficient resource allocation plays a critical role in wireless communication systems. Many resource allocation problems can be formulated into constrained optimization problems, and when the…
(more)

Subjects/Keywords: Nonlinear control theory ; Iterative methods (Mathematics) ; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, J. (2015). Design and analysis of iterative algorithms via nonlinear control theory. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-76119 ; https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chen, Junting. “Design and analysis of iterative algorithms via nonlinear control theory.” 2015. Thesis, Hong Kong University of Science and Technology. Accessed May 08, 2021. http://repository.ust.hk/ir/Record/1783.1-76119 ; https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chen, Junting. “Design and analysis of iterative algorithms via nonlinear control theory.” 2015. Web. 08 May 2021.

Vancouver:

Chen J. Design and analysis of iterative algorithms via nonlinear control theory. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2015. [cited 2021 May 08]. Available from: http://repository.ust.hk/ir/Record/1783.1-76119 ; https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen J. Design and analysis of iterative algorithms via nonlinear control theory. [Thesis]. Hong Kong University of Science and Technology; 2015. Available from: http://repository.ust.hk/ir/Record/1783.1-76119 ; https://doi.org/10.14711/thesis-b1449468 ; http://repository.ust.hk/ir/bitstream/1783.1-76119/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Pennsylvania

3.
Fazlyab, Mahyar.
Control Theoretic Methods In Analysis And Design Of Optimization * Algorithms*.

Degree: 2018, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/3066

► Recently, there has been a surge of interest in incorporating tools from dynamical systems and control theory to analyze and design *iterative* optimization *algorithms*. This…
(more)

Subjects/Keywords: Iterative Algorithms; Numerical Optimization; Robust Control; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fazlyab, M. (2018). Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/3066

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Fazlyab, Mahyar. “Control Theoretic Methods In Analysis And Design Of Optimization Algorithms.” 2018. Thesis, University of Pennsylvania. Accessed May 08, 2021. https://repository.upenn.edu/edissertations/3066.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fazlyab, Mahyar. “Control Theoretic Methods In Analysis And Design Of Optimization Algorithms.” 2018. Web. 08 May 2021.

Vancouver:

Fazlyab M. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. [Internet] [Thesis]. University of Pennsylvania; 2018. [cited 2021 May 08]. Available from: https://repository.upenn.edu/edissertations/3066.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fazlyab M. Control Theoretic Methods In Analysis And Design Of Optimization Algorithms. [Thesis]. University of Pennsylvania; 2018. Available from: https://repository.upenn.edu/edissertations/3066

Not specified: Masters Thesis or Doctoral Dissertation

University of KwaZulu-Natal

4.
Owolabi, Abd-semii Oluwatosin-Enitan.
Self-adaptive inertial *algorithms* for approximating solutions of split feasilbility, monotone inclusion, variational inequality and fixed point problems.

Degree: 2020, University of KwaZulu-Natal

URL: https://researchspace.ukzn.ac.za/handle/10413/18529

► In this dissertation, we introduce a self-adaptive hybrid inertial algorithm for approximating a solution of split feasibility problem which also solves a monotone inclusion problem…
(more)

Subjects/Keywords: Banach spaces.; Hilbert spaces.; Optimization problems.; Iterative algorithms.; Fixed point problems.; Algorithms.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Owolabi, A. O. (2020). Self-adaptive inertial algorithms for approximating solutions of split feasilbility, monotone inclusion, variational inequality and fixed point problems. (Thesis). University of KwaZulu-Natal. Retrieved from https://researchspace.ukzn.ac.za/handle/10413/18529

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Owolabi, Abd-semii Oluwatosin-Enitan. “Self-adaptive inertial algorithms for approximating solutions of split feasilbility, monotone inclusion, variational inequality and fixed point problems.” 2020. Thesis, University of KwaZulu-Natal. Accessed May 08, 2021. https://researchspace.ukzn.ac.za/handle/10413/18529.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Owolabi, Abd-semii Oluwatosin-Enitan. “Self-adaptive inertial algorithms for approximating solutions of split feasilbility, monotone inclusion, variational inequality and fixed point problems.” 2020. Web. 08 May 2021.

Vancouver:

Owolabi AO. Self-adaptive inertial algorithms for approximating solutions of split feasilbility, monotone inclusion, variational inequality and fixed point problems. [Internet] [Thesis]. University of KwaZulu-Natal; 2020. [cited 2021 May 08]. Available from: https://researchspace.ukzn.ac.za/handle/10413/18529.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Owolabi AO. Self-adaptive inertial algorithms for approximating solutions of split feasilbility, monotone inclusion, variational inequality and fixed point problems. [Thesis]. University of KwaZulu-Natal; 2020. Available from: https://researchspace.ukzn.ac.za/handle/10413/18529

Not specified: Masters Thesis or Doctoral Dissertation

University of Manchester

5. Navarro Poupard, Eduardo. Hamiltonian Decomposition for Online Implementation of Model Predictive Control.

Degree: 2019, University of Manchester

URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:319338

► Reliable and optimal decision-making tools are essential in industry to achieve high performance. One of these tools is Model Predictive Control (MPC), which is an…
(more)

Subjects/Keywords: Model Predictive Control; Optimization Algorithms; Online Implementation; Direct Methods; Iterative Methods; Real-time Optimization Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Navarro Poupard, E. (2019). Hamiltonian Decomposition for Online Implementation of Model Predictive Control. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:319338

Chicago Manual of Style (16^{th} Edition):

Navarro Poupard, Eduardo. “Hamiltonian Decomposition for Online Implementation of Model Predictive Control.” 2019. Doctoral Dissertation, University of Manchester. Accessed May 08, 2021. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:319338.

MLA Handbook (7^{th} Edition):

Navarro Poupard, Eduardo. “Hamiltonian Decomposition for Online Implementation of Model Predictive Control.” 2019. Web. 08 May 2021.

Vancouver:

Navarro Poupard E. Hamiltonian Decomposition for Online Implementation of Model Predictive Control. [Internet] [Doctoral dissertation]. University of Manchester; 2019. [cited 2021 May 08]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:319338.

Council of Science Editors:

Navarro Poupard E. Hamiltonian Decomposition for Online Implementation of Model Predictive Control. [Doctoral Dissertation]. University of Manchester; 2019. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:319338

University of Manchester

6. Navarro Poupard, Eduardo. Hamiltonian decomposition for online implementation of model predictive control.

Degree: PhD, 2019, University of Manchester

URL: https://www.research.manchester.ac.uk/portal/en/theses/hamiltonian-decomposition-for-online-implementation-of-model-predictive-control(c03dd385-343d-439a-abd3-b56d409ed589).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.809313

► Reliable and optimal decision-making tools are essential in industry to achieve high performance. One of these tools is Model Predictive Control (MPC), which is an…
(more)

Subjects/Keywords: Real-time Optimization Algorithms; Direct Methods; Iterative Methods; Optimization Algorithms; Model Predictive Control; Online Implementation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Navarro Poupard, E. (2019). Hamiltonian decomposition for online implementation of model predictive control. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/hamiltonian-decomposition-for-online-implementation-of-model-predictive-control(c03dd385-343d-439a-abd3-b56d409ed589).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.809313

Chicago Manual of Style (16^{th} Edition):

Navarro Poupard, Eduardo. “Hamiltonian decomposition for online implementation of model predictive control.” 2019. Doctoral Dissertation, University of Manchester. Accessed May 08, 2021. https://www.research.manchester.ac.uk/portal/en/theses/hamiltonian-decomposition-for-online-implementation-of-model-predictive-control(c03dd385-343d-439a-abd3-b56d409ed589).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.809313.

MLA Handbook (7^{th} Edition):

Navarro Poupard, Eduardo. “Hamiltonian decomposition for online implementation of model predictive control.” 2019. Web. 08 May 2021.

Vancouver:

Navarro Poupard E. Hamiltonian decomposition for online implementation of model predictive control. [Internet] [Doctoral dissertation]. University of Manchester; 2019. [cited 2021 May 08]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/hamiltonian-decomposition-for-online-implementation-of-model-predictive-control(c03dd385-343d-439a-abd3-b56d409ed589).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.809313.

Council of Science Editors:

Navarro Poupard E. Hamiltonian decomposition for online implementation of model predictive control. [Doctoral Dissertation]. University of Manchester; 2019. Available from: https://www.research.manchester.ac.uk/portal/en/theses/hamiltonian-decomposition-for-online-implementation-of-model-predictive-control(c03dd385-343d-439a-abd3-b56d409ed589).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.809313

Stellenbosch University

7.
Moalosi, Tumelo Carel Godwin.
The value of different reconstruction *algorithms* for quantification of FDG PET brain imaging.

Degree: MSc, Medical Imaging, 2016, Stellenbosch University

URL: http://hdl.handle.net/10019.1/100326

►

ENGLISH SUMMARY : Modern reconstruction techniques of positron emission tomography/computed tomography (PET/CT) data are optimized for whole body imaging. Such optimization is less developed for… (more)

Subjects/Keywords: Tomography, Emission; Image reconstruction; Iterative reconstruction algorithms; Brain – Imaging; UCTD

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Moalosi, T. C. G. (2016). The value of different reconstruction algorithms for quantification of FDG PET brain imaging. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/100326

Chicago Manual of Style (16^{th} Edition):

Moalosi, Tumelo Carel Godwin. “The value of different reconstruction algorithms for quantification of FDG PET brain imaging.” 2016. Masters Thesis, Stellenbosch University. Accessed May 08, 2021. http://hdl.handle.net/10019.1/100326.

MLA Handbook (7^{th} Edition):

Moalosi, Tumelo Carel Godwin. “The value of different reconstruction algorithms for quantification of FDG PET brain imaging.” 2016. Web. 08 May 2021.

Vancouver:

Moalosi TCG. The value of different reconstruction algorithms for quantification of FDG PET brain imaging. [Internet] [Masters thesis]. Stellenbosch University; 2016. [cited 2021 May 08]. Available from: http://hdl.handle.net/10019.1/100326.

Council of Science Editors:

Moalosi TCG. The value of different reconstruction algorithms for quantification of FDG PET brain imaging. [Masters Thesis]. Stellenbosch University; 2016. Available from: http://hdl.handle.net/10019.1/100326

Penn State University

8. Suchoski, Bradley Todd. Adapting Sparse Triangular Solution to GPU.

Degree: 2012, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/15429

► Trends in recent years have shown that high performance computing systems are increasingly including GPUs to increase oating point calculation throughput for scienti�c applications. Many…
(more)

Subjects/Keywords: GPU; Parallel Algorithms; Sparse Iterative Solvers; Sparse Triangular Solution; Graph Coloring

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Suchoski, B. T. (2012). Adapting Sparse Triangular Solution to GPU. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/15429

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Suchoski, Bradley Todd. “Adapting Sparse Triangular Solution to GPU.” 2012. Thesis, Penn State University. Accessed May 08, 2021. https://submit-etda.libraries.psu.edu/catalog/15429.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Suchoski, Bradley Todd. “Adapting Sparse Triangular Solution to GPU.” 2012. Web. 08 May 2021.

Vancouver:

Suchoski BT. Adapting Sparse Triangular Solution to GPU. [Internet] [Thesis]. Penn State University; 2012. [cited 2021 May 08]. Available from: https://submit-etda.libraries.psu.edu/catalog/15429.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Suchoski BT. Adapting Sparse Triangular Solution to GPU. [Thesis]. Penn State University; 2012. Available from: https://submit-etda.libraries.psu.edu/catalog/15429

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

9. Zhang, Le. Parallel Simulation for VLSI Power Grid.

Degree: PhD, Computer Engineering, 2015, Texas A&M University

URL: http://hdl.handle.net/1969.1/155474

► Due to the increasing complexity of VLSI circuits, power grid simulation has become more and more time-consuming. Hence, there is a need for fast and…
(more)

Subjects/Keywords: VLSI Power Grid; Parallel Algorithms; Iterative Solver; Enlarged Partitions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, L. (2015). Parallel Simulation for VLSI Power Grid. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155474

Chicago Manual of Style (16^{th} Edition):

Zhang, Le. “Parallel Simulation for VLSI Power Grid.” 2015. Doctoral Dissertation, Texas A&M University. Accessed May 08, 2021. http://hdl.handle.net/1969.1/155474.

MLA Handbook (7^{th} Edition):

Zhang, Le. “Parallel Simulation for VLSI Power Grid.” 2015. Web. 08 May 2021.

Vancouver:

Zhang L. Parallel Simulation for VLSI Power Grid. [Internet] [Doctoral dissertation]. Texas A&M University; 2015. [cited 2021 May 08]. Available from: http://hdl.handle.net/1969.1/155474.

Council of Science Editors:

Zhang L. Parallel Simulation for VLSI Power Grid. [Doctoral Dissertation]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155474

University of Texas – Austin

10.
Lee, Sang Hyun, 1977-.
On a class of distributed *algorithms* over networks and graphs.

Degree: PhD, Electrical and Computer Engineering, 2011, University of Texas – Austin

URL: http://hdl.handle.net/2152/ETD-UT-2011-05-3093

► Distributed *iterative* *algorithms* are of great importance, as they are known to provide low-complexity and approximate solutions to what are otherwise high-dimensional intractable optimization problems.…
(more)

Subjects/Keywords: Distributed algorithms; Graphical models; Belief propagation; Affinity propagation; Resource allocation; Genomic sequence analysis; Distributed iterative algorithms; Message-passing algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lee, Sang Hyun, 1. (2011). On a class of distributed algorithms over networks and graphs. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-3093

Chicago Manual of Style (16^{th} Edition):

Lee, Sang Hyun, 1977-. “On a class of distributed algorithms over networks and graphs.” 2011. Doctoral Dissertation, University of Texas – Austin. Accessed May 08, 2021. http://hdl.handle.net/2152/ETD-UT-2011-05-3093.

MLA Handbook (7^{th} Edition):

Lee, Sang Hyun, 1977-. “On a class of distributed algorithms over networks and graphs.” 2011. Web. 08 May 2021.

Vancouver:

Lee, Sang Hyun 1. On a class of distributed algorithms over networks and graphs. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2011. [cited 2021 May 08]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3093.

Council of Science Editors:

Lee, Sang Hyun 1. On a class of distributed algorithms over networks and graphs. [Doctoral Dissertation]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3093

Indian Institute of Science

11. Pooja, A. A Multiview Extension Of The ICP Algorithm.

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

URL: http://etd.iisc.ac.in/handle/2005/1284

► The *Iterative* Closest Point (ICP) algorithm has been an extremely popular method for 3D points or surface registration. Given two point sets, it simultaneously solves…
(more)

Subjects/Keywords: Image Processing - Algorithms; Algorithms; Iterative Closest Point Algorithm; 3D Registration; Multiview Registration; Motion Averaging; Computer Vision; ICP Algorithm; Iterative Closest Point (ICP); Applied Optics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pooja, A. (2011). A Multiview Extension Of The ICP Algorithm. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/1284

Chicago Manual of Style (16^{th} Edition):

Pooja, A. “A Multiview Extension Of The ICP Algorithm.” 2011. Masters Thesis, Indian Institute of Science. Accessed May 08, 2021. http://etd.iisc.ac.in/handle/2005/1284.

MLA Handbook (7^{th} Edition):

Pooja, A. “A Multiview Extension Of The ICP Algorithm.” 2011. Web. 08 May 2021.

Vancouver:

Pooja A. A Multiview Extension Of The ICP Algorithm. [Internet] [Masters thesis]. Indian Institute of Science; 2011. [cited 2021 May 08]. Available from: http://etd.iisc.ac.in/handle/2005/1284.

Council of Science Editors:

Pooja A. A Multiview Extension Of The ICP Algorithm. [Masters Thesis]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ac.in/handle/2005/1284

NSYSU

12.
Huang, Wei-Shiou.
Convergence Analysis for Inertial Krasnoselskii-Mann Type *Iterative* * Algorithms*.

Degree: Master, Applied Mathematics, 2011, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0216111-213732

► We consider the problem of finding a common fixed point of an infinite family {T_{n}} of nonlinear self-mappings of a closed convex subset C of…
(more)

Subjects/Keywords: demiclosedness principle; KM Type iterative algorithms; inertial iteration; fixed point; Weak convergence; nonexpansive mapping

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Huang, W. (2011). Convergence Analysis for Inertial Krasnoselskii-Mann Type Iterative Algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0216111-213732

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Huang, Wei-Shiou. “Convergence Analysis for Inertial Krasnoselskii-Mann Type Iterative Algorithms.” 2011. Thesis, NSYSU. Accessed May 08, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0216111-213732.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Huang, Wei-Shiou. “Convergence Analysis for Inertial Krasnoselskii-Mann Type Iterative Algorithms.” 2011. Web. 08 May 2021.

Vancouver:

Huang W. Convergence Analysis for Inertial Krasnoselskii-Mann Type Iterative Algorithms. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 May 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0216111-213732.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang W. Convergence Analysis for Inertial Krasnoselskii-Mann Type Iterative Algorithms. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0216111-213732

Not specified: Masters Thesis or Doctoral Dissertation

13.
Padmanabhan Poti, Siri.
* Iterative* robust search (iRoSe) : a framework for coevolutionary hyperparameter optimisation.

Degree: 2020, Western Sydney University

URL: http://hdl.handle.net/1959.7/uws:58306

► Finding an optimal hyperparameter configuration for machine learning *algorithms* is challenging due to hyperparameter effects that could vary with *algorithms*, dataset and distribution, as also…
(more)

Subjects/Keywords: machine learning; algorithms; iterative methods (mathematics); Thesis (M.Res.) – Western Sydney University, 2020

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Padmanabhan Poti, S. (2020). Iterative robust search (iRoSe) : a framework for coevolutionary hyperparameter optimisation. (Thesis). Western Sydney University. Retrieved from http://hdl.handle.net/1959.7/uws:58306

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Padmanabhan Poti, Siri. “Iterative robust search (iRoSe) : a framework for coevolutionary hyperparameter optimisation.” 2020. Thesis, Western Sydney University. Accessed May 08, 2021. http://hdl.handle.net/1959.7/uws:58306.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Padmanabhan Poti, Siri. “Iterative robust search (iRoSe) : a framework for coevolutionary hyperparameter optimisation.” 2020. Web. 08 May 2021.

Vancouver:

Padmanabhan Poti S. Iterative robust search (iRoSe) : a framework for coevolutionary hyperparameter optimisation. [Internet] [Thesis]. Western Sydney University; 2020. [cited 2021 May 08]. Available from: http://hdl.handle.net/1959.7/uws:58306.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Padmanabhan Poti S. Iterative robust search (iRoSe) : a framework for coevolutionary hyperparameter optimisation. [Thesis]. Western Sydney University; 2020. Available from: http://hdl.handle.net/1959.7/uws:58306

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

14. Hoemmen, Mark. Communication-avoiding Krylov subspace methods.

Degree: Computer Science, 2010, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/7757521k

► The cost of an algorithm includes both arithmetic and communication.We use "communication" in a general sense to mean data movement,either between levels of a memory…
(more)

Subjects/Keywords: Computer Science; Mathematics; communication-avoiding algorithms; iterative methods; linear algebra; numerical methods; parallel algorithms; sparse matrices

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hoemmen, M. (2010). Communication-avoiding Krylov subspace methods. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7757521k

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hoemmen, Mark. “Communication-avoiding Krylov subspace methods.” 2010. Thesis, University of California – Berkeley. Accessed May 08, 2021. http://www.escholarship.org/uc/item/7757521k.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hoemmen, Mark. “Communication-avoiding Krylov subspace methods.” 2010. Web. 08 May 2021.

Vancouver:

Hoemmen M. Communication-avoiding Krylov subspace methods. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2021 May 08]. Available from: http://www.escholarship.org/uc/item/7757521k.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hoemmen M. Communication-avoiding Krylov subspace methods. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/7757521k

Not specified: Masters Thesis or Doctoral Dissertation

15.
Li, Ningzhi.
The convergence envelope for *iterative* estimation in SS-PARSE.

Degree: MS, 2008, University of Alabama – Birmingham

URL: http://contentdm.mhsl.uab.edu/u?/etd,349

►

A novel and recently developed fast magnetic resonance imaging (MRI) technique, Single-Shot Parameter Assessment by Retrieval from Signal Encoding (SSPARSE), promises significant improvements in robustness… (more)

Subjects/Keywords: Magnetic resonance imaging – Computer programs <; br>; Iterative methods (Mathematics) <; br>; Computer algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, N. (2008). The convergence envelope for iterative estimation in SS-PARSE. (Masters Thesis). University of Alabama – Birmingham. Retrieved from http://contentdm.mhsl.uab.edu/u?/etd,349

Chicago Manual of Style (16^{th} Edition):

Li, Ningzhi. “The convergence envelope for iterative estimation in SS-PARSE.” 2008. Masters Thesis, University of Alabama – Birmingham. Accessed May 08, 2021. http://contentdm.mhsl.uab.edu/u?/etd,349.

MLA Handbook (7^{th} Edition):

Li, Ningzhi. “The convergence envelope for iterative estimation in SS-PARSE.” 2008. Web. 08 May 2021.

Vancouver:

Li N. The convergence envelope for iterative estimation in SS-PARSE. [Internet] [Masters thesis]. University of Alabama – Birmingham; 2008. [cited 2021 May 08]. Available from: http://contentdm.mhsl.uab.edu/u?/etd,349.

Council of Science Editors:

Li N. The convergence envelope for iterative estimation in SS-PARSE. [Masters Thesis]. University of Alabama – Birmingham; 2008. Available from: http://contentdm.mhsl.uab.edu/u?/etd,349

UCLA

16.
Keys, Kevin Lawrence.
Projection *algorithms* for large scale optimization and genomic data analysis.

Degree: Biomathematics, 2016, UCLA

URL: http://www.escholarship.org/uc/item/95v3t2nk

► The advent of the Big Data era has spawned intense interest in scalable mathematical optimization methods. Traditional approaches such as Newton’s method fall apart whenever…
(more)

Subjects/Keywords: Mathematics; Bioinformatics; Biostatistics; distance majorization; exact penalty method; genome wide association study; iterative hard thresholding; proximal gradient algorithms; sparse regression

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Keys, K. L. (2016). Projection algorithms for large scale optimization and genomic data analysis. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/95v3t2nk

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Keys, Kevin Lawrence. “Projection algorithms for large scale optimization and genomic data analysis.” 2016. Thesis, UCLA. Accessed May 08, 2021. http://www.escholarship.org/uc/item/95v3t2nk.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Keys, Kevin Lawrence. “Projection algorithms for large scale optimization and genomic data analysis.” 2016. Web. 08 May 2021.

Vancouver:

Keys KL. Projection algorithms for large scale optimization and genomic data analysis. [Internet] [Thesis]. UCLA; 2016. [cited 2021 May 08]. Available from: http://www.escholarship.org/uc/item/95v3t2nk.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Keys KL. Projection algorithms for large scale optimization and genomic data analysis. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/95v3t2nk

Not specified: Masters Thesis or Doctoral Dissertation

University of KwaZulu-Natal

17. Anuoluwapo, Abass Hammed. On common fixed points approximation of countable families of certain multi-valued maps in hilbert spaces.

Degree: 2017, University of KwaZulu-Natal

URL: http://hdl.handle.net/10413/15524

► Fixed point theory and its applications have been widely studied by many researchers. Di erent *iterative* *algorithms* have been used extensively to approximate solutions of…
(more)

Subjects/Keywords: Theses - Computer Science.; Fixed point theory.; Hilbert spaces.; Multi-valued Mappings.; Iterative algorithms.; Split equilibrium problems.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Anuoluwapo, A. H. (2017). On common fixed points approximation of countable families of certain multi-valued maps in hilbert spaces. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15524

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Anuoluwapo, Abass Hammed. “On common fixed points approximation of countable families of certain multi-valued maps in hilbert spaces.” 2017. Thesis, University of KwaZulu-Natal. Accessed May 08, 2021. http://hdl.handle.net/10413/15524.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Anuoluwapo, Abass Hammed. “On common fixed points approximation of countable families of certain multi-valued maps in hilbert spaces.” 2017. Web. 08 May 2021.

Vancouver:

Anuoluwapo AH. On common fixed points approximation of countable families of certain multi-valued maps in hilbert spaces. [Internet] [Thesis]. University of KwaZulu-Natal; 2017. [cited 2021 May 08]. Available from: http://hdl.handle.net/10413/15524.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Anuoluwapo AH. On common fixed points approximation of countable families of certain multi-valued maps in hilbert spaces. [Thesis]. University of KwaZulu-Natal; 2017. Available from: http://hdl.handle.net/10413/15524

Not specified: Masters Thesis or Doctoral Dissertation

University of KwaZulu-Natal

18.
Chinedu, Izuchukwu.
*Iterative**algorithms* for approximating solutions of variational inequality problems and monotone inclusion problems.

Degree: 2017, University of KwaZulu-Natal

URL: http://hdl.handle.net/10413/15845

► In this work, we introduce and study an *iterative* algorithm independent of the operator norm for approximating a common solution of split equality variational inequality…
(more)

Subjects/Keywords: Theses - Mathematics, Statistics and Computer Science.; Iterative algorithms.; Theorems.; Hilbert spaces.; Banach space.; Variational inequality problems.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chinedu, I. (2017). Iterative algorithms for approximating solutions of variational inequality problems and monotone inclusion problems. (Thesis). University of KwaZulu-Natal. Retrieved from http://hdl.handle.net/10413/15845

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Chinedu, Izuchukwu. “Iterative algorithms for approximating solutions of variational inequality problems and monotone inclusion problems.” 2017. Thesis, University of KwaZulu-Natal. Accessed May 08, 2021. http://hdl.handle.net/10413/15845.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Chinedu, Izuchukwu. “Iterative algorithms for approximating solutions of variational inequality problems and monotone inclusion problems.” 2017. Web. 08 May 2021.

Vancouver:

Chinedu I. Iterative algorithms for approximating solutions of variational inequality problems and monotone inclusion problems. [Internet] [Thesis]. University of KwaZulu-Natal; 2017. [cited 2021 May 08]. Available from: http://hdl.handle.net/10413/15845.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chinedu I. Iterative algorithms for approximating solutions of variational inequality problems and monotone inclusion problems. [Thesis]. University of KwaZulu-Natal; 2017. Available from: http://hdl.handle.net/10413/15845

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

19. Tantipongpipat, Uthaipon. Fair and diverse data representation in machine learning.

Degree: PhD, Computer Science, 2020, Georgia Tech

URL: http://hdl.handle.net/1853/63581

► The work contains two major lines of research: subset selection and multi-criteria dimensionality reduction with an application to fairness. Subset selection can be applied to…
(more)

Subjects/Keywords: Subset selection; Diverse sampling; Optimal design; Approximation algorithms; Fair PCA; Multi-criteria dimensionality reduction; Iterative rounding

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tantipongpipat, U. (2020). Fair and diverse data representation in machine learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/63581

Chicago Manual of Style (16^{th} Edition):

Tantipongpipat, Uthaipon. “Fair and diverse data representation in machine learning.” 2020. Doctoral Dissertation, Georgia Tech. Accessed May 08, 2021. http://hdl.handle.net/1853/63581.

MLA Handbook (7^{th} Edition):

Tantipongpipat, Uthaipon. “Fair and diverse data representation in machine learning.” 2020. Web. 08 May 2021.

Vancouver:

Tantipongpipat U. Fair and diverse data representation in machine learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2021 May 08]. Available from: http://hdl.handle.net/1853/63581.

Council of Science Editors:

Tantipongpipat U. Fair and diverse data representation in machine learning. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/63581

20. Wilson, Craig. Communication strategies for the MIMO interference channel.

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

URL: http://hdl.handle.net/2142/29794

► Managing interference for wireless networks is crucial for meeting future demand for higher mobile data rates. Interference can be viewed through the interference channel (IC)…
(more)

Subjects/Keywords: wireless networks; interference channels; iterative algorithms; throughput

…insights gained from capacity analyses, several convergent *iterative* *algorithms* that seek to… …*iterative* *algorithms*
k=1 d
in this section we impose a per user power constraint of P .
4.2… …x5D;
to give better sum rate performance.
Another *iterative* algorithm, Max SINR, was… …algorithm outperforms the other *algorithms*
mentioned before, but there is no proof that it… …a
non-convex function, the new algorithm, like the other proposed *algorithms*,
converges to…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wilson, C. (2012). Communication strategies for the MIMO interference channel. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/29794

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wilson, Craig. “Communication strategies for the MIMO interference channel.” 2012. Thesis, University of Illinois – Urbana-Champaign. Accessed May 08, 2021. http://hdl.handle.net/2142/29794.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wilson, Craig. “Communication strategies for the MIMO interference channel.” 2012. Web. 08 May 2021.

Vancouver:

Wilson C. Communication strategies for the MIMO interference channel. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 May 08]. Available from: http://hdl.handle.net/2142/29794.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wilson C. Communication strategies for the MIMO interference channel. [Thesis]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/29794

Not specified: Masters Thesis or Doctoral Dissertation

21. Brabant, Loes. Latest developments in the improvement and quantification of high resolution X-ray tomography data.

Degree: 2013, Ghent University

URL: http://hdl.handle.net/1854/LU-4193900

► X-ray Computed Tomography (CT) is a powerful tool to visualize the internal structure of objects. Although X-ray CT is often used for medical purposes, it…
(more)

Subjects/Keywords: Physics and Astronomy; Iterative reconstruction algorithms; 3D analysis; High resolution X-ray computed tomography; Beam hardening; Discrete reconstruction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Brabant, L. (2013). Latest developments in the improvement and quantification of high resolution X-ray tomography data. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-4193900

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Brabant, Loes. “Latest developments in the improvement and quantification of high resolution X-ray tomography data.” 2013. Thesis, Ghent University. Accessed May 08, 2021. http://hdl.handle.net/1854/LU-4193900.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Brabant, Loes. “Latest developments in the improvement and quantification of high resolution X-ray tomography data.” 2013. Web. 08 May 2021.

Vancouver:

Brabant L. Latest developments in the improvement and quantification of high resolution X-ray tomography data. [Internet] [Thesis]. Ghent University; 2013. [cited 2021 May 08]. Available from: http://hdl.handle.net/1854/LU-4193900.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Brabant L. Latest developments in the improvement and quantification of high resolution X-ray tomography data. [Thesis]. Ghent University; 2013. Available from: http://hdl.handle.net/1854/LU-4193900

Not specified: Masters Thesis or Doctoral Dissertation

University of Lund

22. Holmquist, Fredrik. Low kilovoltage computed tomography to reduce contrast medium dose in patients at risk of acute kidney injury.

Degree: 2021, University of Lund

URL: https://lup.lub.lu.se/record/35491e80-d692-4b0e-8392-333c7d640ecd ; https://portal.research.lu.se/ws/files/89683396/e_spik_ex_Fredrik.pdf

► Background: Patients with reduced renal function may be at risk of contrast medium-induced acute kidney injury (CI-AKI) following intravenous iodine contrast medium (CM) enhanced computed…
(more)

Subjects/Keywords: Radiology, Nuclear Medicine and Medical Imaging; Computed tomography; Image quality; Radiation dosimetry; contrast medium induced nephropathy; Iterative reconstruction algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Holmquist, F. (2021). Low kilovoltage computed tomography to reduce contrast medium dose in patients at risk of acute kidney injury. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/35491e80-d692-4b0e-8392-333c7d640ecd ; https://portal.research.lu.se/ws/files/89683396/e_spik_ex_Fredrik.pdf

Chicago Manual of Style (16^{th} Edition):

Holmquist, Fredrik. “Low kilovoltage computed tomography to reduce contrast medium dose in patients at risk of acute kidney injury.” 2021. Doctoral Dissertation, University of Lund. Accessed May 08, 2021. https://lup.lub.lu.se/record/35491e80-d692-4b0e-8392-333c7d640ecd ; https://portal.research.lu.se/ws/files/89683396/e_spik_ex_Fredrik.pdf.

MLA Handbook (7^{th} Edition):

Holmquist, Fredrik. “Low kilovoltage computed tomography to reduce contrast medium dose in patients at risk of acute kidney injury.” 2021. Web. 08 May 2021.

Vancouver:

Holmquist F. Low kilovoltage computed tomography to reduce contrast medium dose in patients at risk of acute kidney injury. [Internet] [Doctoral dissertation]. University of Lund; 2021. [cited 2021 May 08]. Available from: https://lup.lub.lu.se/record/35491e80-d692-4b0e-8392-333c7d640ecd ; https://portal.research.lu.se/ws/files/89683396/e_spik_ex_Fredrik.pdf.

Council of Science Editors:

Holmquist F. Low kilovoltage computed tomography to reduce contrast medium dose in patients at risk of acute kidney injury. [Doctoral Dissertation]. University of Lund; 2021. Available from: https://lup.lub.lu.se/record/35491e80-d692-4b0e-8392-333c7d640ecd ; https://portal.research.lu.se/ws/files/89683396/e_spik_ex_Fredrik.pdf

23.
Danjean, Ludovic.
Algorithmes itératifs à faible complexité pour le codage de canal et le compressed sensing : Low Complexity *Iterative* *Algorithms* for Channel Coding and Compressed Sensing.

Degree: Docteur es, STIC (sciences et technologies de l'information et de la communication) - Cergy, 2012, Cergy-Pontoise; University of Arizona

URL: http://www.theses.fr/2012CERG0586

► L'utilisation d'algorithmes itératifs est aujourd'hui largement répandue dans tous les domaines du traitement du signal et des communications numériques. Dans les systèmes de communications modernes,…
(more)

Subjects/Keywords: Algorithmes itératifs; Décodeur multi-niveaux; Codes LDPC; Compressed sensing; Algorithmes de reconstruction; Iterative algorithms; Multilevel decoders; LDPC codes; Compressed sensing; Reconstruction algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Danjean, L. (2012). Algorithmes itératifs à faible complexité pour le codage de canal et le compressed sensing : Low Complexity Iterative Algorithms for Channel Coding and Compressed Sensing. (Doctoral Dissertation). Cergy-Pontoise; University of Arizona. Retrieved from http://www.theses.fr/2012CERG0586

Chicago Manual of Style (16^{th} Edition):

Danjean, Ludovic. “Algorithmes itératifs à faible complexité pour le codage de canal et le compressed sensing : Low Complexity Iterative Algorithms for Channel Coding and Compressed Sensing.” 2012. Doctoral Dissertation, Cergy-Pontoise; University of Arizona. Accessed May 08, 2021. http://www.theses.fr/2012CERG0586.

MLA Handbook (7^{th} Edition):

Danjean, Ludovic. “Algorithmes itératifs à faible complexité pour le codage de canal et le compressed sensing : Low Complexity Iterative Algorithms for Channel Coding and Compressed Sensing.” 2012. Web. 08 May 2021.

Vancouver:

Danjean L. Algorithmes itératifs à faible complexité pour le codage de canal et le compressed sensing : Low Complexity Iterative Algorithms for Channel Coding and Compressed Sensing. [Internet] [Doctoral dissertation]. Cergy-Pontoise; University of Arizona; 2012. [cited 2021 May 08]. Available from: http://www.theses.fr/2012CERG0586.

Council of Science Editors:

Danjean L. Algorithmes itératifs à faible complexité pour le codage de canal et le compressed sensing : Low Complexity Iterative Algorithms for Channel Coding and Compressed Sensing. [Doctoral Dissertation]. Cergy-Pontoise; University of Arizona; 2012. Available from: http://www.theses.fr/2012CERG0586

Indian Institute of Science

24. Raveendran, Nithin. A Modified Sum-Product Algorithm over Graphs with Short Cycles.

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

URL: http://etd.iisc.ac.in/handle/2005/3847

► We investigate into the limitations of the sum-product algorithm for binary low density parity check (LDPC) codes having isolated short cycles. Independence assumption among messages…
(more)

Subjects/Keywords: Computer Mathematics; Decoding Algorithms; Sum-Product Algorithms; Low Density Parity Check Codes (LDPC); Error Control Codes; Graphical Codes; Modified Message Passing Algorithm; Tanner Grpahs; Graph Algorithms; Cycle (Graph Theory); Short Cycle Graphs; Graphs; Iterative Decoding Algorithm; Electronic System Engineerin

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Raveendran, N. (2018). A Modified Sum-Product Algorithm over Graphs with Short Cycles. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3847

Chicago Manual of Style (16^{th} Edition):

Raveendran, Nithin. “A Modified Sum-Product Algorithm over Graphs with Short Cycles.” 2018. Masters Thesis, Indian Institute of Science. Accessed May 08, 2021. http://etd.iisc.ac.in/handle/2005/3847.

MLA Handbook (7^{th} Edition):

Raveendran, Nithin. “A Modified Sum-Product Algorithm over Graphs with Short Cycles.” 2018. Web. 08 May 2021.

Vancouver:

Raveendran N. A Modified Sum-Product Algorithm over Graphs with Short Cycles. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2021 May 08]. Available from: http://etd.iisc.ac.in/handle/2005/3847.

Council of Science Editors:

Raveendran N. A Modified Sum-Product Algorithm over Graphs with Short Cycles. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3847

25. Smarda, Magdalini. Χρήση επαναληπτικού αλγορίθμου ανακατασκευής εικόνας σε αξονικές τομογραφίες θώρακος υψηλής ευκρίνειας σε παιδιά: διερεύνηση της ποιότητας της εικόνας σε σχέση με τη δόση της ακτινοβολίας στον εξεταζόμενο.

Degree: 2018, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ)

URL: http://hdl.handle.net/10442/hedi/42894

►

Purpose of the study: High radiosensitivity of children undergoing computerized tomography (CT) has rendered the use of the recently developed *Iterative* Reconstruction (IR) *Algorithms* particularly…
(more)

Subjects/Keywords: χρόνια πυώδης νόσος πνεύμονα; Αλγόριθμοι, Επαναληπτικοί; Αξονική τομογραφία υψηλής διακριτικής ικανότητας; Απορροφούμενη δόση ακτινοβολίας; chronic suppurative lung disease; Iterative algorithms; High resolution computed tomography (HRCT); Radiation dose intake

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Smarda, M. (2018). Χρήση επαναληπτικού αλγορίθμου ανακατασκευής εικόνας σε αξονικές τομογραφίες θώρακος υψηλής ευκρίνειας σε παιδιά: διερεύνηση της ποιότητας της εικόνας σε σχέση με τη δόση της ακτινοβολίας στον εξεταζόμενο. (Thesis). National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Retrieved from http://hdl.handle.net/10442/hedi/42894

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Smarda, Magdalini. “Χρήση επαναληπτικού αλγορίθμου ανακατασκευής εικόνας σε αξονικές τομογραφίες θώρακος υψηλής ευκρίνειας σε παιδιά: διερεύνηση της ποιότητας της εικόνας σε σχέση με τη δόση της ακτινοβολίας στον εξεταζόμενο.” 2018. Thesis, National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ). Accessed May 08, 2021. http://hdl.handle.net/10442/hedi/42894.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Smarda, Magdalini. “Χρήση επαναληπτικού αλγορίθμου ανακατασκευής εικόνας σε αξονικές τομογραφίες θώρακος υψηλής ευκρίνειας σε παιδιά: διερεύνηση της ποιότητας της εικόνας σε σχέση με τη δόση της ακτινοβολίας στον εξεταζόμενο.” 2018. Web. 08 May 2021.

Vancouver:

Smarda M. Χρήση επαναληπτικού αλγορίθμου ανακατασκευής εικόνας σε αξονικές τομογραφίες θώρακος υψηλής ευκρίνειας σε παιδιά: διερεύνηση της ποιότητας της εικόνας σε σχέση με τη δόση της ακτινοβολίας στον εξεταζόμενο. [Internet] [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. [cited 2021 May 08]. Available from: http://hdl.handle.net/10442/hedi/42894.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Smarda M. Χρήση επαναληπτικού αλγορίθμου ανακατασκευής εικόνας σε αξονικές τομογραφίες θώρακος υψηλής ευκρίνειας σε παιδιά: διερεύνηση της ποιότητας της εικόνας σε σχέση με τη δόση της ακτινοβολίας στον εξεταζόμενο. [Thesis]. National and Kapodistrian University of Athens; Εθνικό και Καποδιστριακό Πανεπιστήμιο Αθηνών (ΕΚΠΑ); 2018. Available from: http://hdl.handle.net/10442/hedi/42894

Not specified: Masters Thesis or Doctoral Dissertation

University of Michigan

26.
Vijacksungsithi, Wongkot.
Low-density parity -check codes and *iterative* decoding *algorithms* for input -constrained channels and channels with memory.

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

URL: http://hdl.handle.net/2027.42/123489

► The quest to construct good error-correcting codes that are amendable to low complexity decoding has been vigorously pursued since 1948 when Shannon introduced the channel…
(more)

Subjects/Keywords: Algorithms; Density; Input-constrained Channels; Iterative Decoding; Low; Memory; Parity-check Codes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vijacksungsithi, W. (2003). Low-density parity -check codes and iterative decoding algorithms for input -constrained channels and channels with memory. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/123489

Chicago Manual of Style (16^{th} Edition):

Vijacksungsithi, Wongkot. “Low-density parity -check codes and iterative decoding algorithms for input -constrained channels and channels with memory.” 2003. Doctoral Dissertation, University of Michigan. Accessed May 08, 2021. http://hdl.handle.net/2027.42/123489.

MLA Handbook (7^{th} Edition):

Vijacksungsithi, Wongkot. “Low-density parity -check codes and iterative decoding algorithms for input -constrained channels and channels with memory.” 2003. Web. 08 May 2021.

Vancouver:

Vijacksungsithi W. Low-density parity -check codes and iterative decoding algorithms for input -constrained channels and channels with memory. [Internet] [Doctoral dissertation]. University of Michigan; 2003. [cited 2021 May 08]. Available from: http://hdl.handle.net/2027.42/123489.

Council of Science Editors:

Vijacksungsithi W. Low-density parity -check codes and iterative decoding algorithms for input -constrained channels and channels with memory. [Doctoral Dissertation]. University of Michigan; 2003. Available from: http://hdl.handle.net/2027.42/123489

Texas A&M University

27.
Mahawar, Hemant.
Parallel *algorithms* for inductance extraction.

Degree: PhD, Computer Science, 2007, Texas A&M University

URL: http://hdl.handle.net/1969.1/5930

► In VLSI circuits, signal delays play an important role in design, timing verification and signal integrity checks. These delays are attributed to the presence of…
(more)

Subjects/Keywords: Preconditioning; Inductance Extraction; Parallel Algorithms; Mixed Mode Parallelization; Iterative Methods

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mahawar, H. (2007). Parallel algorithms for inductance extraction. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/5930

Chicago Manual of Style (16^{th} Edition):

Mahawar, Hemant. “Parallel algorithms for inductance extraction.” 2007. Doctoral Dissertation, Texas A&M University. Accessed May 08, 2021. http://hdl.handle.net/1969.1/5930.

MLA Handbook (7^{th} Edition):

Mahawar, Hemant. “Parallel algorithms for inductance extraction.” 2007. Web. 08 May 2021.

Vancouver:

Mahawar H. Parallel algorithms for inductance extraction. [Internet] [Doctoral dissertation]. Texas A&M University; 2007. [cited 2021 May 08]. Available from: http://hdl.handle.net/1969.1/5930.

Council of Science Editors:

Mahawar H. Parallel algorithms for inductance extraction. [Doctoral Dissertation]. Texas A&M University; 2007. Available from: http://hdl.handle.net/1969.1/5930

North Carolina State University

28.
Kacar, Necip Baris.
Developing and Fitting a Clearing Function Form: An Experimental Comparison of A Clearing Function Model and *Iterative* Simulation-Optimization Algorithm for Production Planning of a Semiconductor Fab.

Degree: MS, Industrial Engineering, 2009, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/1881

► Kacar, Necip Baris. Developing and Fitting a Clearing Function: An Experimental Comparison of A Clearing Function Model and *Iterative* Simulation-Optimization Algorithm for Production Planning of…
(more)

Subjects/Keywords: Simulation based Optimization Models; Experimental Comparison; Semiconductor Fabrication; Clearing Functions; Production Planning; Iterative Algorithms; Nonlinear Capacity Model; Load Dependent Lead Time Modelling; WIP; Cycle Times

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kacar, N. B. (2009). Developing and Fitting a Clearing Function Form: An Experimental Comparison of A Clearing Function Model and Iterative Simulation-Optimization Algorithm for Production Planning of a Semiconductor Fab. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1881

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kacar, Necip Baris. “Developing and Fitting a Clearing Function Form: An Experimental Comparison of A Clearing Function Model and Iterative Simulation-Optimization Algorithm for Production Planning of a Semiconductor Fab.” 2009. Thesis, North Carolina State University. Accessed May 08, 2021. http://www.lib.ncsu.edu/resolver/1840.16/1881.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kacar, Necip Baris. “Developing and Fitting a Clearing Function Form: An Experimental Comparison of A Clearing Function Model and Iterative Simulation-Optimization Algorithm for Production Planning of a Semiconductor Fab.” 2009. Web. 08 May 2021.

Vancouver:

Kacar NB. Developing and Fitting a Clearing Function Form: An Experimental Comparison of A Clearing Function Model and Iterative Simulation-Optimization Algorithm for Production Planning of a Semiconductor Fab. [Internet] [Thesis]. North Carolina State University; 2009. [cited 2021 May 08]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1881.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kacar NB. Developing and Fitting a Clearing Function Form: An Experimental Comparison of A Clearing Function Model and Iterative Simulation-Optimization Algorithm for Production Planning of a Semiconductor Fab. [Thesis]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1881

Not specified: Masters Thesis or Doctoral Dissertation

29.
Whitson, Hayley.
Quantifying differences in CT image quality between a model-based *iterative* reconstruction algorithm, an adaptive statistical *iterative* reconstruction algorithm, and filtered backprojection.

Degree: MS, 2017, Oregon Health Sciences University

URL: doi:10.6083/M4QF8SC9 ; http://digitalcommons.ohsu.edu/etd/3913

Subjects/Keywords: computed tomography; iterative reconstruction; reconstruction algorithms; image quality; Medicine and Health Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Whitson, H. (2017). Quantifying differences in CT image quality between a model-based iterative reconstruction algorithm, an adaptive statistical iterative reconstruction algorithm, and filtered backprojection. (Thesis). Oregon Health Sciences University. Retrieved from doi:10.6083/M4QF8SC9 ; http://digitalcommons.ohsu.edu/etd/3913

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Whitson, Hayley. “Quantifying differences in CT image quality between a model-based iterative reconstruction algorithm, an adaptive statistical iterative reconstruction algorithm, and filtered backprojection.” 2017. Thesis, Oregon Health Sciences University. Accessed May 08, 2021. doi:10.6083/M4QF8SC9 ; http://digitalcommons.ohsu.edu/etd/3913.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Whitson, Hayley. “Quantifying differences in CT image quality between a model-based iterative reconstruction algorithm, an adaptive statistical iterative reconstruction algorithm, and filtered backprojection.” 2017. Web. 08 May 2021.

Vancouver:

Whitson H. Quantifying differences in CT image quality between a model-based iterative reconstruction algorithm, an adaptive statistical iterative reconstruction algorithm, and filtered backprojection. [Internet] [Thesis]. Oregon Health Sciences University; 2017. [cited 2021 May 08]. Available from: doi:10.6083/M4QF8SC9 ; http://digitalcommons.ohsu.edu/etd/3913.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Whitson H. Quantifying differences in CT image quality between a model-based iterative reconstruction algorithm, an adaptive statistical iterative reconstruction algorithm, and filtered backprojection. [Thesis]. Oregon Health Sciences University; 2017. Available from: doi:10.6083/M4QF8SC9 ; http://digitalcommons.ohsu.edu/etd/3913

Not specified: Masters Thesis or Doctoral Dissertation

University of KwaZulu-Natal

30.
Aibinu, Mathew Olajiire.
*Iterative**algorithms* for solutions of nonlinear equations in Banach spaces.

Degree: 2019, University of KwaZulu-Natal

URL: https://researchspace.ukzn.ac.za/handle/10413/16907

Subjects/Keywords: Iterative algorithms.; Nonlinear equations.; Monotone mappings.; Banach spaces.; Hilbert spaces.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Aibinu, M. O. (2019). Iterative algorithms for solutions of nonlinear equations in Banach spaces. (Thesis). University of KwaZulu-Natal. Retrieved from https://researchspace.ukzn.ac.za/handle/10413/16907

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Aibinu, Mathew Olajiire. “Iterative algorithms for solutions of nonlinear equations in Banach spaces.” 2019. Thesis, University of KwaZulu-Natal. Accessed May 08, 2021. https://researchspace.ukzn.ac.za/handle/10413/16907.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Aibinu, Mathew Olajiire. “Iterative algorithms for solutions of nonlinear equations in Banach spaces.” 2019. Web. 08 May 2021.

Vancouver:

Aibinu MO. Iterative algorithms for solutions of nonlinear equations in Banach spaces. [Internet] [Thesis]. University of KwaZulu-Natal; 2019. [cited 2021 May 08]. Available from: https://researchspace.ukzn.ac.za/handle/10413/16907.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aibinu MO. Iterative algorithms for solutions of nonlinear equations in Banach spaces. [Thesis]. University of KwaZulu-Natal; 2019. Available from: https://researchspace.ukzn.ac.za/handle/10413/16907

Not specified: Masters Thesis or Doctoral Dissertation