mirage

Browsing School of Electrical Engineering and Computer Science by Title

DSpace/Manakin Repository

Browsing School of Electrical Engineering and Computer Science by Title

Sort by: Order: Results:

  • Kinematic and cyclostationary parameter estimation for co-channel emitter location applications 
    Ohm, David R. (2007-12-04)
    The problem of locating a signal source, or an emitter, has many civilian and military applications, such as communication regulations enforcement, military reconnaissance, and search-and-rescue operations. Many of the m ...
  • Knowledge-based decision model construction for hierarchical diagnosis and repair 
    Yuan, Soe-Tsyr (1994-06-06)
    Knowledge-Based Model Construction (KBMC) has generated a lot of attention due to its importance as a technique for generating probabilistic or decision-theoretic models whose range of applicability in AI has been vast ...
  • LacEDAemon : a programming environment for the multiparadigm language leda 
    Pandey, Rajeev K. (1998-08-28)
    Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms without departing from ...
  • Layered rendering model for human teeth 
    Shetty, Sudarshanram (2010-12-28)
    This study introduces a layered model for rendering human teeth. Human teeth exhibit complex light interaction due to their layered structure. While the lighting responses of teeth have been studied in the dental industr ...
  • Layout dependent and bias independent scalable substrate model for RF MOSFETs 
    Suravarapu, Ravikanth (2003-01-07)
    The dependence of the substrate resistance, R[subscript sub], for MOS transistor RF modeling on transistor biasing and layout is studied from device simulations and measurements. Though R[subscript sub] is found to be ...
  • LDPC-VBLAST for wireless communications 
    Poocharoen, Panupat (2005-03-15)
  • Leaf shape recognition via support vector machines with edit distance kernels 
    Sinha, Shriprakash (2004-03-05)
    Edit distances are a well-established technique for classification problems. They have been employed successfully in many classification problems including chromosome classification and hand-written digit recognition. Vi ...
  • Leakage power minimization by considering self-bias transistor and pin reordering technique 
    Gopalakrishnan, Harish (2004-09-02)
    Recent trends in CMOS technology and scaling of devices clearly indicate that leakage power in digital circuits would be crucial and largely depend on the sub-threshold current. Minimizing leakage is gaining increasing ...
  • Learning and reasoning 
    Oregon State University. Dept. of Computer Science; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2003-05-26)
    What is the relationship between learning and reasoning? Much recent work in machine learning has been criticized for focusing on learning and ignoring reasoning. This paper attempts to describe the various ways in which ...
  • Learning classification rules by randomized iterative local search 
    Chisholm, Michael (Michael Andrew), 1974- (1999-11-22)
    Learning easily understandable decision rules from examples is one of the classic problems in machine learning. Most learning algorithms for this problem employ some variation of a greedy separate-and-conquer algorithm ...
  • Learning cost-sensitive diagnostic policies from data 
    Zubek, Valentina Bayer (2003-07-16)
    In its simplest form, the process of diagnosis is a decision-making process in which the diagnostician performs a sequence of tests culminating in a diagnostic decision. For example, a physician might perform a series ...
  • Learning decision trees for loss minimization in multi-class problems 
    Oregon State University. Dept. of Computer Science; Margineantu, Dragos D. (Dragos Dorin); Dietterich, Thomas G. (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1999)
    Many machine learning applications require classifiers that minimize an asymmetric loss function rather than the raw misclassification rate. We study methods for modifying C4.5 to incorporate arbitrary loss matrices. On ...
  • Learning diagnostic policies from examples by systematic search 
    Oregon State University. Dept. of Computer Science; Zubek, Valentina Bayer (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2004)
    A diagnostic policy species what test to perform next based on the results of previous tests and when to stop and make a diagnosis. Cost-sensitive diagnostic policies perform tradeoffs between (a) the costs of tests and ...
  • Learning hierarchical decomposition rules for planning : an inductive logic programming approach 
    Reddy, Chandrasekhara K. (1998-06-30)
    Arti cial Intelligence (AI) planning techniques have been central to automating a gamut of tasks from the mundane route planning and beer production to the ethereal image processing of space-ship images. Of all the pla ...
  • Learning multiple non-redundant codebooks with word clustering for document classification 
    Surve, Akshat Sudhakar (2009-07-09)
    The problem of document classification has been widely studied in machine learning and data mining. In document classification, most of the popular algorithms are based on the bag-of-words representation. Due to the high ...
  • Learning objectives for courses in the Department of Computer Science, Oregon State University 
    Oregon State University. Dept. of Computer Science (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2002-04-01)
    This document describes the overall learning objectives for courses in the department of computer science at Oregon State University.
  • Learning ranking functions for efficient search 
    Xu, Yuehua (2010-08-12)
    This dissertation explores algorithms for learning ranking functions to efficiently solve search problems, with application to automated planning. Specifically, we consider the frameworks of beam search, greedy search, a ...
  • LEDA : a blending of imperative and relational programming 
    Oregon State University. Dept. of Computer Science; Budd, Timothy (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1994-09-20)
    This paper describes features of a new strongly typed, compiled programming language, called LEDA. LEDA attempts to combine aspects of both imperative (value-oriented) and logical (relation-oriented) styles of programmin ...
  • Leyline : a provenance-based desktop search system using graphical sketchpad user interface 
    Ghorashi, Seyed Soroush (2011-12-07)
    While there are powerful keyword search systems that index all kinds of resources including emails and web pages, people have trouble recalling semantic facts such as the name, location, edit dates and keywords that un ...
  • A library for doing polyhedral operations 
    Wilde, Doran K. (1993-12-06)
    Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures for operating on polyhedra can be ...

Search ScholarsArchive@OSU


Advanced Search

Browse

My Account

Statistics