• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4200
  • 1250
  • 510
  • 267
  • 200
  • 119
  • 91
  • 46
  • 45
  • 45
  • 45
  • 45
  • 45
  • 43
  • 35
  • Tagged with
  • 8420
  • 2437
  • 1620
  • 1142
  • 1110
  • 1108
  • 1052
  • 983
  • 926
  • 919
  • 875
  • 806
  • 734
  • 568
  • 527
  • 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.
461

Visual linearization of image data for the display of digital intraoral radiographs

Li, Gang. January 2004 (has links)
Thesis (doctoral)--karolinska Institutet, Stockholm, 2004. / Added t.p. with thesis statement inserted. Includes bibliographical references.
462

Survey of approximation algorithms for set cover problem

Dutta, Himanshu Shekhar. Shahrokhi, Farhad M., January 2009 (has links)
Thesis (M.S.)--University of North Texas, Dec., 2009. / Title from title page display. Includes bibliographical references.
463

Discrete cosine transform implementation in VHDL

Hu, Ta-Hsiang. January 1990 (has links) (PDF)
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 1990. / Thesis Advisor(s): Lee, Chin-Hwa ; Yang, Chyan. "December 1990." Description based on title screen as viewed on March 29, 2010. DTIC Identifier(s): Fast Fourier Transform, High Level Languages, CHIPS (Electronics), Computerized Simulation, Signal Processing, Theses, Algorithms, Floating Point Operation, VHDL (Vhsic Hardware Description Language). Author(s) subject terms: FFT System, DCT System Implementation. Includes bibliographical references (p. 152). Also available in print.
464

Topics in sparse approximation

Tropp, Joel Aaron, Dhillon, Inderjit S., Gilbert, Anna C. January 2004 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisors: Inderjit S. Dhillon and Anna C. Gilbert. Vita. Includes bibliographical references. Also available from UMI.
465

An algorithm module for abstract algebra

Chao, Kenneth Koe-nan. Parr, James T. January 1980 (has links)
Thesis (D.A.)--Illinois State University, 1980. / Title from title page screen, viewed Feb. 16, 2005. Dissertation Committee: James Parr (chair), Albert Otto, Larry Eggan, Lotus Hershberger, John Dossey, Gary Ramseyer. Includes bibliographical references (leaves 197-200) and abstract. Also available in print.
466

Design of principal component fuzzy systems from data /

Dai, Wenhui. January 2004 (has links)
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 48-52). Also available in electronic version. Access restricted to campus users.
467

A block incremental algorithm for computing dominant singular subspaces

Baker, Christopher G. Gallivan, Kyle. January 2004 (has links)
Thesis (M.S.)--Florida State University, 2004. / Advisor: Dr. Kyle Gallivan, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Sept. 23, 2004). Includes bibliographical references.
468

Fundamental algorithms for physical design planning of VLSI

Tang, Xiaoping. January 2002 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.
469

Circle formation algorithm for autonomous agents with local sensing /

Michael, Andrew Mario. January 2004 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2004. / Typescript. Includes bibliographical references (leaves [112]-115).
470

Window-based project scheduling algorithms /

Smith, Tristan, January 2004 (has links)
Thesis (Ph. D.)--University of Oregon, 2004. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 189-198). Also available for download via the World Wide Web; free to University of Oregon users.

Page generated in 0.0347 seconds