Now showing items 1-20 of 102

  • The 2nu-SVM: A Cost-Sensitive Extension of the nu-SVM 

    Davenport, Mark A. (2005-12-01)
    Standard classification algorithms aim to minimize the probability of making an incorrect classification. In many important applications, however, some kinds of errors are more important than others. In this report we ...
  • An Adaptive Orthogonal-Series Estimator for Probability Density Functions 

    Anderson, G. Leigh; de Figueiredo, Rui J.P. (1978-02-20)
    Given a sample set X1,...,XN of independent identically distributed real-valued random variables, each with the unknown probability density function f(â ¢), the problem considered is to estimate f from the sample set. The ...
  • Adaptive Wavelet Transforms via Lifting 

    Claypoole, Roger L.; Baraniuk, Richard G.; Nowak, Robert David (1999-01-15)
    This paper develops new algorithms for adapted multiscale analysis and signal adaptive wavelet transforms. We construct our adaptive transforms with the <i>lifting scheme</i>, which decomposes the wavelet transform into ...
  • An Algorithm for Extraction of More than One Optimal Linear Feature from Several Gaussian Pattern Classes 

    de Figueiredo, Rui J.P.; Pau, K.C.; Sagar, A. D.; Starks, S.A.; Van Rooy, D.L. (1976-04-20)
    Two algorithms have been developed at Rice University for optimal linear feature extraction based on the minimization risk (probability) of misclassification under the assumption that the class conditional probability ...
  • An Algorithm for Optimal Single Linear Feature Extraction from Several Gaussian Pattern Classes 

    Starks, S.A.; de Figueiredo, Rui J.P.; Van Rooy, D.L. (1975-11-20)
    A computational algorithm is presented for the extraction of an optimal single linear feature from several Gaussian pattern classes. The algorithm minimizes the increase in the probability of misclassification in the ...
  • An Algorithm to Factor Polynomial Matrices 

    Kontos, Athanassios (1979-04-01)
    A new algorithm for factoring polynomial matrices, based on concept of elementary factors, is presented in this report. This algorithm does not use numerically unsatisfactory Euclidean type operations.
  • Algorithms for Optimal Dynamic Assignment in Distributed Processing Systems 

    Sinclair, J. Bartlett (1979-08-20)
    The problem of determining an optimal dynamic assignment of a modular program in a loosely coupled distributed processing system is considered. An optimal dynamic assignment minimizes the sum of all module execution costs, ...
  • Algorithms for Optimal Numerical Quadrature Based on Signal Class Models 

    de Figueiredo, Rui J.P. (1979-11-01)
    A framework is presented for constructing various types of numerical quadrature algorithms which take into account the a-priori known or estimated properties of the signal being processed. This is done by appropriately ...
  • Ambipolar electronics 

    Yang, Xuebei; Mohanram, Kartik (2010-03-02)
    Ambipolar conduction, characterized by a superposition of electron and hole currents, has been observed in many next-generation devices including carbon nanotube, graphene, silicon nanowire, and organic transistors. ...
  • Analog Computer Simulation of Maximum Expiratory Flow Limitation 

    Olender, Mark F.; Clark, Jr., J.W.; Stevens, P.M. (1975-01-20)
    This paper extends previous modeling work in our laboratory on the simulation of the panting maneuver executed in a body plethysmograph [Golden, et al. (1973)] to the simulation of a wider range of pulmonary function tests ...
  • Analysis of the DCS one-stage Greedy Algorothm for Common Sparse Supports 

    Baron, Dror; Duarte, Marco F.; Wakin, Michael; Sarvotham, Shriram; Baraniuk, Richard G. (2005-11-01)
    Analysis of the DCS one-stage Greedy Algorothm for Common Sparse Supports
  • APL Programs for Polynomial Matrix Manipulations 

    Kontos, Athanassios (1979-12-01)
    This report contains descriptions and listings of APL programs.
  • APL Programs for Singular Value Decomposition and Generalized Eigenvalue Problems 

    Kontos, Athanassios; Moore, Robert (1979-09-20)
    This report contains descriptions and listings of APL functions for singular value decomposition and solution of the generalized eigenvalue problem.
  • APL Programs for the Solution of RPIS 

    Prescott, Richard; Moore, Robert (1978-08-20)
    This report contains the documentaiton for twelve APL functions written to facilitate the solution of the Regulator Problem with Internal Stability (RPIS). These new functions draw on the library of APL functions assembled ...
  • Application of a Frequency Domain Prony Method to Wide Bandwidth Radar Signature Classification 

    de Figueiredo, Rui J.P.; Hu, C.L. (1979-09-20)
    A frequency domain Prony approach is presented for extracting features of return signals from targets illuminated by wide bandwidth (short pulse) radar. Theoretical details pertaining to this approach are described in a ...
  • Blind Algorithms for Channel Estimation and Detection in Wireless Handsets 

    Livingston, Frank; Cavallaro, Joseph R. (2000-05-20)
    Multiple access is an important consideration in the design and implementation of wireless communications systems. Code division multiple access (CDMA) is one method for providing multiple access in a wireless system. In ...
  • Characterization of Iron Doped Lithium Niobate for Holographic Storage Applications 

    Shah, Rajiv R.; Kim, Dae M.; Rabson, Thomas A.; Tittel, Frank K. (1976-06-20)
    A detailed study of eight systematically chosen Fe:LiNb0<sub>3</sub> crystals is presented. Correlation between the photorefractive sensitivity and various chemical properties of Fe:LiNb0<sub>3</sub> is investigated in ...
  • Compressing Piecewise Smooth Multidimensional Functions Using Surflets: Rate-Distortion Analysis 

    Chandrasekaran, Venkat; Wakin, Michael; Baron, Dror; Baraniuk, Richard G. (2004-03-01)
    Discontinuities in data often represent the key information of interest. Efficient representations for such discontinuities are important for many signal processing applications, including compression, but standard Fourier ...
  • Computation of a Unimodular Matrix 

    Kontos, Athanassios; de Figueiredo, Rui J.P. (1979-12-01)
    An algorithm for computing a unimodular matrix U(&lambda;) satisfying the equation [A(&lambda;) B(&lambda;)] U(&lambda;) = [1 0] is presented where A(&lambda;) and B(&lambda;) are relatively left prime polynomial matrices. ...
  • Computationally Efficient Estimators for the Bayes Risk 

    Wilcox, Lynn D.; de Figueiredo, Rui J.P. (1978-05-20)
    A computationally efficient estimator for the Bayes risk is one which achieves a desired accuracy with a minimum of computation. In many problems, for example speech recognition, point evaluations of the class conditional ...