• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 95
  • 15
  • 10
  • 9
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 137
  • 137
  • 137
  • 24
  • 24
  • 23
  • 18
  • 18
  • 17
  • 17
  • 16
  • 16
  • 16
  • 15
  • 13
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Space curves generated by iterated function systems

Massopust, Peter Robert 08 1900 (has links)
No description available.
12

Hyperbolic iterated function systems and applications

Hardin, Douglas Patten 12 1900 (has links)
No description available.
13

Video Compression based on iterated function systems

Paul, Baldine-Brunel 08 1900 (has links)
No description available.
14

Construction of the inverse in a Banach algebra by iteration

Kovács, Rezsö Lázló. January 1968 (has links)
No description available.
15

Preconditioned iterative methods for highly sparse, nonsymmetric, unstructured linear algebra problems /

McQuain, William D., January 1992 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 60-63). Also available via the Internet.
16

Fast iterative methods for solving Toeplitz and Toeplitz-like systems /

Ng, Kwok-po. January 1992 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1993. / Photocopy typescript.
17

Iterative linear programming for linear complementarity and related problems

Shiau, Tzong-Huei. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1983. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 106-111).
18

Construction of the inverse in a Banach algebra by iteration

Kovács, Rezsö Lázló. January 1968 (has links)
No description available.
19

The geometry of self-affine sets and graph-directed systems. / CUHK electronic theses & dissertations collection

January 2000 (has links)
by He Xinggang. / "December 2000." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (p. 69-73). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.
20

Iterative consolidation on unorganized point clouds and its application in design.

January 2011 (has links)
Chan, Kwan Chung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 63-69). / Abstracts in English and Chinese. / Abstract --- p.v / Acknowledgements --- p.ix / List of Figures --- p.xiii / List of Tables --- p.xv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Main contributions --- p.4 / Chapter 1.2 --- Overview --- p.4 / Chapter 2 --- Related Work --- p.7 / Chapter 2.1 --- Point cloud processing --- p.7 / Chapter 2.2 --- Model repairing --- p.9 / Chapter 2.3 --- Deformation and reconstruction --- p.10 / Chapter 3 --- Iterative Consolidation on Un-orientated Point Clouds --- p.11 / Chapter 3.1 --- Algorithm overview --- p.12 / Chapter 3.2 --- Down-sampling and outliers removal --- p.14 / Chapter 3.2.1 --- Normal estimation --- p.14 / Chapter 3.2.2 --- Down-sampling --- p.15 / Chapter 3.2.3 --- Particle noise removal --- p.17 / Chapter 3.3 --- APSS based repulsion --- p.19 / Chapter 3.4 --- Refinement --- p.22 / Chapter 3.4.1 --- Adaptive up-sampling --- p.22 / Chapter 3.4.2 --- Selection of up-sampled points --- p.23 / Chapter 3.4.3 --- Sample noise removal --- p.23 / Chapter 3.5 --- Set constraints to sample points --- p.24 / Chapter 4 --- Shape Modeling by Point Set --- p.27 / Chapter 4.1 --- Principle of deformation --- p.27 / Chapter 4.2 --- Selection --- p.29 / Chapter 4.3 --- Stretching and compressing --- p.30 / Chapter 4.4 --- Bending and twisting --- p.30 / Chapter 4.5 --- Inserting points --- p.30 / Chapter 5 --- Results and Discussion --- p.37 / Chapter 5.1 --- Program environment --- p.37 / Chapter 5.2 --- Results of iterative consolidation on un-orientated points --- p.37 / Chapter 5.3 --- Effect of our de-noising based on up-sampled points --- p.44 / Chapter 6 --- Conclusions --- p.49 / Chapter 6.1 --- Advantages --- p.49 / Chapter 6.2 --- Factors affecting our algorithm --- p.50 / Chapter 6.3 --- Possible future works --- p.51 / Chapter 6.3.1 --- Improve on the quality of results --- p.51 / Chapter 6.3.2 --- Reduce user input --- p.52 / Chapter 6.3.3 --- Multi-thread computation --- p.52 / Chapter A --- Finding Neighbors --- p.53 / Chapter A.1 --- k-d Tree --- p.53 / Chapter A.2 --- Octree --- p.54 / Chapter A.3 --- Minimum spanning tree --- p.55 / Chapter B --- Principle Component Analysis --- p.57 / Chapter B.1 --- Principle component analysis --- p.57 / Chapter C --- UI of the program --- p.59 / Chapter C.1 --- User Interface --- p.59 / Chapter D --- Publications --- p.61 / Bibliography --- p.63

Page generated in 0.0877 seconds