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

Advanced algorithms for formal concept analysis

Krajča, Petr. January 2009 (has links)
Thesis (Ph. D.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2009. / Includes bibliographical references.
502

Development of computer vision algorithms using J2ME for mobile phone applications : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in the University of Canterbury /

Gu, Jian, January 1900 (has links)
Thesis (M. Sc.)--University of Canterbury, 2008. / Typescript (photocopy). "November 2008." Includes bibliographical references (p. 91-96). Also available via the World Wide Web.
503

Performance comparison between three different bit allocation algorithms inside a critically decimated cascading filter bank

Weaver, Michael B. January 2009 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Electrical and Computer Engineering, 2009. / Includes bibliographical references.
504

A trusted environment for MPI programs

Florez-Larrahondo, German, January 2002 (has links)
Thesis (M.S.)--Mississippi State University. Department of Computer Science. / Title from title screen. Includes bibliographical references.
505

An advanced signal processing toolkit for Java applications

Shah, Vijay Pravin, January 2002 (has links)
Thesis (M.S.)--Mississippi State University. Department of Electrical and Computer Engineering. / Title from title screen. Includes bibliographical references.
506

Nearest neighbor queries in spatial and spatio-temporal databases /

Zhang, Jun. January 2003 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 125-131). Also available in electronic version. Access restricted to campus users.
507

A distributed routing algorithm for ER-LSP setup in MLPS networks

Garige, Naga Siddhardha. January 2003 (has links)
Thesis (M.S.)--University of South Florida, 2003. / Title from PDF of title page. Document formatted into pages; contains 62 pages. Includes bibliographical references.
508

High level static analysis of system descriptions for taming verification complexity

Vasudevan, Shobha 14 June 2012 (has links)
Not available / text
509

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

Johnson, Gregory Scott, 1971- 28 September 2012 (has links)
A fundamental operation in computer graphics is to determine for a given point and direction in a scene, which geometric surface is nearest this point from this direction and thus visible. Conceptually, the point and direction define a "ray". Z-buffer hardware can compute surface visibility for a set of rays with a common origin (i.e. eye point) and a regular pattern of directions in real-time. However, this hardware is much less efficient at performing other visibility computations such as those required to accurately render shadows. A more flexible solution to the visible surface problem is needed. This work introduces the irregular Z-buffer algorithm, which efficiently solves the visible surface problem for rays with a common origin and arbitrary directions. In addition, we identify several changes to classical graphics architectures needed for hardware acceleration of this algorithm. Though these modifications are incremental in nature (i.e. no new functional units are introduced), we show that they enable significant new capability. In tandem with the irregular Z-buffer algorithm, a GPU with these changes has applications in: shadow rendering, indirect illumination, frameless rendering, adaptive anti-aliasing, adaptive textures, and jittered sampling. We explore the performance of hard and soft shadow rendering in particular, by way of a detailed hardware simulator. / text
510

Non-coding RNA identification along genome

Wong, king-fung., 黃景峰. January 2011 (has links)
published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy

Page generated in 0.0682 seconds