• 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.
371

A hybrid real-time visible surface solution for rays with a common origin and arbitrary directions

Johnson, Gregory Scott, January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2008. / Vita. Includes bibliographical references.
372

The convergence envelope for iterative estimation in SS-PARSE

Li, Ningzhi. January 2008 (has links) (PDF)
Thesis (M.S.)--University of Alabama at Birmingham, 2008. / Description based on contents viewed Feb. 11, 2009; title from PDF t.p. Includes bibliographical references (p. 49-54).
373

Studies on sorting networks and expanders

Xie, Hang. January 1998 (has links)
Thesis (M.S.)--Ohio University, August, 1998. / Title from PDF t.p.
374

"a+b" arithmetic theory and implementation.

Manickavasagam, SenthilKumar. January 1996 (has links)
Thesis (M.S.)--Ohio University, March, 1996. / Title from PDF t.p.
375

Algoritmes vir die maksimering van konvekse en verwante knapsakprobleme /

Visagie, S. E. January 2007 (has links)
Thesis (PhD)--University of Stellenbosch, 2007. / Bibliography. Also availabe via the Internet.
376

The discovery of interacting episodes and temporal rule determination in sequential pattern mining

Mooney, Carl Howard, January 2006 (has links)
Thesis (Ph.D.)--Flinders University, School of Informatics and Engineering. / Typescript bound. Includes bibliographical references: (leaves 204-221) Also available online.
377

Optimizations and applications of Trie-Tree based frequent pattern mining

King, Stuart. January 2006 (has links)
Thesis (M. S.)--Michigan State University. Dept. of Computer Science and Engineering, 2006. / Title from PDF t.p. (viewed on June 19, 2009) Includes bibliographical references (p. 79-80). Also issued in print.
378

New approaches for robust clustering and for estimating the optimal number of clusters /

Frigui, Hichem, January 1997 (has links)
Thesis (Ph. D.)--University of Missouri-Columbia, 1997. / Typescript. Vita. Includes bibliographical references (leaves 190-194). Also available on the Internet.
379

From Tapestry to SVD a survey of the algorithms that power Recommender systems /

Huttner, Joseph. January 2009 (has links)
Thesis (B.A.)--Haverford College, Dept. of Computer Science, 2009. / Includes bibliographical references.
380

Independence fault collapsing and concurrent test generation

Doshi, Alok Shreekant. Agrawal, Vishwani D., January 2006 (has links) (PDF)
Thesis(M.S.)--Auburn University, 2006. / Abstract. Vita. Includes bibliographic references (p.74-78).

Page generated in 0.0511 seconds