NDLTD Global ETD Search
  • 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.

Search results

Showing 421 to 430 of 8420 (0.036 seconds)

Spelling suggestions: "subject:"algorithms"" "subject:"a.lgorithms""

421

The complexities of tracking quantiles and frequent items in a data stream

Hung, Yee-shing, Regant. January 2009 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2009. / Includes bibliographical references (p. 122-132) Also available in print.
Data mining. Algorithms.
422

A faster algorithm for the single source shortest path problem with few distinct positive lengths

Williamson, Matthew D. January 2009 (has links)
Thesis (M.S.)--West Virginia University, 2009. / Title from document title page. Document formatted into pages; contains viii, 42 p. : ill. Includes abstract. Includes bibliographical references (p. 41-42).
Algorithms. Graph theory.
423

Comparative study of two methods for recursive parameters identification : Kalman filter with hypothesis testing and directional forgetting /

Janusz, Mariusz January 1900 (has links)
Thesis (M. App. Sc.)--Carleton University, 2001. / Includes bibliographical references (p. 117). Also available in electronic format on the Internet.
Kalman filtering. Algorithms.
424

I/O-efficient algorithms for shortest path related problems /

Zeh, Norbert Ralf, January 1900 (has links)
Thesis (Ph.D.) - Carleton University, 2002. / Includes bibliographical references (p. 327-340). Also available in electronic format on the Internet.
Algorithms. Graphy theory.
425

Scheduling in DSP multiprocessor systems /

Chao, Suryani, January 1900 (has links)
Thesis (M.App.Sc.) - Carleton University, 2002. / Includes bibliographical references (p. 94-96). Also available in electronic format on the Internet.
426

The average complexity of the Euclidean algorithm and hyperelliptic cryptography /

Savard, Stephen, January 1900 (has links)
Thesis (M. Sc.)--Carleton University, 2003. / Includes bibliographical references (p. 62-63). Also available in electronic format on the Internet.
427

An algorithm to construct representations of finite groups /

Dabbaghian-Abdoly, Vahid, January 1900 (has links)
Thesis (Ph. D.)--Carleton University, 2003. / Includes bibliographical references (p. 125-129). Also available in electronic format on the Internet.
Finite groups. Algorithms.
428

On utilizing new histogram-based methods for query optimization /

Chen, Jing, January 1900 (has links)
Thesis (M.C.S.)--Carleton University, 2003. / Includes bibliographical references (p. 150-156). Also available in electronic format on the Internet.
429

Algorithms for bivariate zonoid depth /

Gopala, Harish, January 1900 (has links)
Thesis (M.C.S.)--Carleton University, 2004. / Includes bibliographical references (p. 27-29). Also available in electronic format on the Internet.
430

Well-separated pair decompositions for doubling metric spaces /

Xu, Daming, January 1900 (has links)
Thesis (M.C.S.) Carleton University, 2005. / Includes bibliographical references (p. 36-41). Also available in electronic format on the Internet.
Metric spaces. Algorithms. Geometry

Page generated in 0.0422 seconds