NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 588
  • 44
  • 39
  • 37
  • 9
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 1
  • 1
  • Tagged with
  • 768
  • 768
  • 185
  • 174
  • 156
  • 135
  • 119
  • 82
  • 71
  • 66
  • 63
  • 63
  • 59
  • 55
  • 48
  • 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.

Search results

Showing 301 to 310 of 768 (0.043 seconds)

Spelling suggestions: "subject:"computer algorithms."" "subject:"aomputer algorithms.""

301

Empirical investigation of decision tree extraction from neural networks

Rangwala, Maimuna H. January 2006 (has links)
Thesis (M.S.)--Ohio University, June, 2006. / Title from PDF t.p. Includes bibliographical references (p. 125-130)
302

Fault-tolerant communications in parallel systems

Park, Seungjin 04 March 1993 (has links)
Graduation date: 1993
Fault-tolerant computing
Hypercube
Computer algorithms
303

Fast and efficient video coding based on communication and computation scheduling on multiprocessors

Leung, Kwong-Keung. January 2001 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 317-338).
304

Efficient NTRU implementations

O'Rourke, Colleen Marie. January 2002 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: NTRU; cryptography; scalable multiplier; unified multiplier; Montgomery multiplier. Includes bibliographical references (p. 85-88).
305

Indirect text entry interfaces based on Huffman coding with unequal letter costs /

Hussain, Fatima Omman. January 2008 (has links)
Thesis (M.Sc.)--York University, 2008. Graduate Programme in Science. / Typescript. Includes bibliographical references (leaves 223-232). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR45965
306

Communication-efficient bulk synchronous parallel algorithms

Huang, Chun-Hsi. January 2001 (has links)
Thesis (Ph. D.)--State University of New York at Buffalo, 2001. / Includes bibliographical references (leaves 126-136). Also available in print.
307

Architectures and methods for energy-efficient querying and indexing in wireless sensor networks

Park, Kyungseo. January 2008 (has links)
Thesis ( Ph.D.) -- University of Texas at Arlington, 2008.
308

Environment modeling and efficient state reachability checking /

Raimi, Richard Saul. January 1999 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1999. / Vita. Includes bibliographical references (leaves 195-204). Available also in a digital version from Dissertation Abstracts.
309

PARZSweep a novel parallel algorithm for volume rendering of regular datasets /

Ramswamy, Lakshmy. January 2003 (has links)
Thesis (M.S.)--Mississippi State University. Department of Computer Science. / Title from title screen. Includes bibliographical references.
310

RZSweep a new volume-rendering technique for uniform rectilinear datasets /

Chaudhary, Gautam. January 2003 (has links)
Thesis (M.S.)--Mississippi State University. Department of Computer Science. / Title from title screen. Includes bibliographical references.

Page generated in 0.0466 seconds