• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 259
  • 49
  • 17
  • 13
  • 11
  • 11
  • 11
  • 11
  • 11
  • 11
  • 9
  • 6
  • 4
  • 4
  • 3
  • Tagged with
  • 470
  • 470
  • 91
  • 82
  • 68
  • 50
  • 48
  • 45
  • 39
  • 37
  • 35
  • 35
  • 31
  • 30
  • 30
  • 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.
111

A contribution to the automation of DNA fingerprint analysis

Menacer, Mohamed January 1995 (has links)
No description available.
112

Contributions to Descriptive Set Theory

Dance, Cody 12 1900 (has links)
Assume AD+V=L(R). In the first chapter, let W^1_1 denote the club measure on \omega_1. We analyze the embedding j_{W^1_1}\restr HOD from the point of view of inner model theory. We use our analysis to answer a question of Jackson-Ketchersid about codes for ordinals less than \omega_\omega. In the second chapter, we provide an indiscernibles analysis for models of the form L[T_n,x]. We use our analysis to provide new proofs of the strong partition property on \delta^1_{2n+1}
113

A Presentation of Current Research on Partitions of Lines and Space

Nugen, Frederick T. 12 1900 (has links)
We present the results from three papers concerning partitions of vector spaces V over the set R of reals and of the set of lines in V.
114

Two-point sets

Chad, Ben January 2010 (has links)
This thesis concerns two-point sets, which are subsets of the real plane which intersect every line in exactly two points. The existence of two-point sets was first shown in 1914 by Mazukiewicz, and since this time, the properties of these objects have been of great intrigue to mathematicians working in both topology and set theory. Arguably, the most famous problem about two-point sets is concerned with their so-called "descriptive complexity"; it remains open, and it appears to be deep. An informal interpretation of the problem, which traces back at least to Erdos, is: The term "two-point" set can be defined in a way that it is easily understood by someone with only a limited amount of mathemat- ical training. Even so, how hard is it to construct a two-point set? Can one give an effective algorithm which describes precisely how to do so? More formally, Erdos wanted to know if there exists a two-point set which is a Borel subset of the plane. An essential tool in showing the existence of a two-point set is the Axiom of Choice, an axiom which is taken to be one of the basic truths of mathematics.
115

Morphological filtering in signal/image processing

Sedaaghi, Mohammad Hossein January 1998 (has links)
No description available.
116

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.
117

Error bounds for set inclusions and inequality systems. / CUHK electronic theses & dissertations collection / Digital dissertation consortium

January 2002 (has links)
Zheng Xi Yin. / "December 2002." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (p. 117-121). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. Ann Arbor, MI : ProQuest Information and Learning Company, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.
118

Spectral sets and spectral self-affine measures. / CUHK electronic theses & dissertations collection

January 2004 (has links)
by Li Jian Lin. / "November 2004." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (p. 85-90) / 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.
119

Spectral sets and spectral measures.

January 2009 (has links)
Lai, Chun Kit. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 83-87). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.6 / Chapter 2 --- Spectral sets in Rd --- p.11 / Chapter 2.1 --- Preliminaries --- p.11 / Chapter 2.2 --- Fundamental domains and convex sets in Rd --- p.15 / Chapter 2.3 --- Finite union of cubes --- p.20 / Chapter 3 --- Spectral theory on discrete groups --- p.27 / Chapter 3.1 --- Finite groups and Zd --- p.28 / Chapter 3.2 --- Rational spectrums and tiling sets --- p.32 / Chapter 3.3 --- Fuglede´ةs Problem in R1 --- p.37 / Chapter 3.4 --- "Failure of Fuglede´ةs Conjecture in Rd, d >3" --- p.42 / Chapter 4 --- Self-similar tiles in R1 --- p.49 / Chapter 4.1 --- Basics of self-similar tiles --- p.49 / Chapter 4.2 --- Self-similar tile digit sets and spectral problem --- p.52 / Chapter 4.3 --- Kenyon criterion --- p.55 / Chapter 5 --- Spectral self-similar measures --- p.66 / Chapter 5.1 --- Spectral self-similar measures --- p.66 / Chapter 5.2 --- One-dimensional self-similar measures --- p.72 / Chapter 5.3 --- General properties of spectral measures --- p.80 / Bibliography --- p.83
120

On exact algorithms for the maximum independent set problem.

January 2008 (has links)
Wong, Wing Chun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 66-67). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background Study --- p.4 / Chapter 2.1 --- Basic Definitions and Notations --- p.5 / Chapter 2.2 --- Tarjan and Trojanowski's algorithm --- p.6 / Chapter 2.2.1 --- Techniques --- p.6 / Chapter 2.2.2 --- Algorithm --- p.8 / Chapter 2.3 --- "Fomin, Grandoni and Kratsch's Algorithm" --- p.9 / Chapter 2.3.1 --- Techniques --- p.9 / Chapter 2.3.2 --- Algorithm --- p.14 / Chapter 3 --- Improvements --- p.18 / Chapter 3.1 --- Tarjan and Trojanowski´ةs Algorithm --- p.18 / Chapter 3.1.1 --- Correctness and Running Time Analysis --- p.28 / Chapter 3.1.2 --- Improvement --- p.30 / Chapter 3.1.3 --- Using more weights --- p.35 / Chapter 3.2 --- The First Algorithm --- p.37 / Chapter 3.2.1 --- Standard Analysis --- p.37 / Chapter 3.2.2 --- Measure and Conquer --- p.38 / Chapter 3.2.3 --- Using more weights --- p.42 / Chapter 3.3 --- The Second Algorithm --- p.43 / Chapter 3.3.1 --- Running Time Analysis --- p.44 / Chapter 3.3.2 --- Using More Weights --- p.45 / Chapter 3.4 --- The Third Algorithm --- p.46 / Chapter 4 --- Lower Bounds --- p.52 / Chapter 4.1 --- Tarjan and Trojanowski's Algorithm --- p.52 / Chapter 4.2 --- The First Algorithm --- p.55 / Chapter 4.3 --- The Second Algorithm --- p.58 / Chapter 4.4 --- The Third Algorithm --- p.60 / Chapter 5 --- Conclusion --- p.63 / Bibliography --- p.66

Page generated in 0.0391 seconds