Global ETD Search

21	Strategies for handling spatial uncertainty due to discretization / Windholz, Thomas K., January 2001 (has links) Thesis (Ph. D.) in Spatial Information Science and Engineering--University of Maine, 2001. / Includes vita. Includes bibliographical references (leaves 118-132).
22	On direct adaptive control of a class of nonlinear scalar systems / Melin, Alexander M., January 2003 (has links) Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Vita. Includes bibliographical references (leaf 24). Also available on the Internet.
23	On direct adaptive control of a class of nonlinear scalar systems Melin, Alexander M., January 2003 (has links) Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Vita. Includes bibliographical references (leaf 24). Also available on the Internet.
24	Mining uncertain data with probabilistic guarantees Sun, Liwen, 孙理文 January 2010 (has links) published_or_final_version / Computer Science / Master / Master of Philosophy Uncertainty (Information theory) Data mining. Probabilities - Data processing.
25	Voronoi-based nearest neighbor search for multi-dimensional uncertain databases Zhang, Peiwu., 张培武. January 2012 (has links) In Voronoi-based nearest neighbor search, the Voronoi cell of every point p in a database can be used to check whether p is the closest to some query point q. We extend the notion of Voronoi cells to support uncertain objects, whose attribute values are inexact. Particularly, we propose the Possible Voronoi cell (or PV-cell). A PV-cell of a multi-dimensional uncertain object o is a region R, such that for any point p ∈ R, o may be the nearest neighbor of p. If the PV-cells of all objects in a database S are known, they can be used to identify objects that have a chance to be the nearest neighbor of q. However, there is no efficient algorithm for computing an exact PV-cell. We hence study how to derive an axis-parallel hyper-rectangle (called the Uncertain Bounding Rectangle, or UBR) that tightly contains a PV-cell. We further develop the PV-index, a structure that stores UBRs, to evaluate probabilistic nearest neighbor queries over uncertain data. An advantage of the PV-index is that upon updates on S, it can be incrementally updated. Extensive experiments on both synthetic and real datasets are carried out to validate the performance of the PV-index. / published_or_final_version / Computer Science / Master / Master of Philosophy Voronoi polygons. Nearest neighbor analysis (Statistics) Uncertainty (Information theory)
26	Distributed uncertainty analysis techniques for conceptual launch vehicle design McCormick, David Jeremy 08 1900 (has links) No description available. Computer simulation Uncertainty (Information theory)
27	Fast algorithms for computing statistics under interval uncertainty with applications to computer science and to electrical and computer engineering / Xiang, Gang, January 2007 (has links) Thesis (Ph. D.)--University of Texas at El Paso, 2007. / Title from title screen. Vita. CD-ROM. Includes bibliographical references. Also available online.
28	Predicting Effects of Artificial Recharge using Groundwater Flow and Transport Models with First Order Uncertainty Analysis Murphy, David January 1997 (has links) (PDF) Thesis (M.S. - Hydrology and Water Resources)--University of Arizona. / Includes bibliographical references (leaves 113-117).
29	An inductive logic programming approach to statistical relational learning Kersting, Kristian. January 1900 (has links) Thesis (Ph. D.)--Albert-Ludwigs-Universität Freiburg im Breisgau, 2006. / Description based on print version record. Includes bibliographical references (p. 201-221) and index.
30	Simulation of dynamic systems with uncertain parameters Zhang, Fu, Longoria, Raul Gilberto, January 2004 (has links) (PDF) Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Raul G. Longoria. Vita. Includes bibliographical references.

Search results