Browse Research and Tech Reports - Computer Science by Subject "algorithms"

  • Chambers, Erin Wolf (2009-02)
    Many questions about homotopy are provably hard or even unsolvable in general. However, in specific settings, it is possible to efficiently test homotopyequivalence or compute shortest cycles with prescribed homotopy. We ...

    application/pdf

    application/pdfPDF (1Mb)
  • Sen, Koushik; Rosu, Grigore; Agha, Gul A. (2004-12)
    A generalized predictive analysis technique is proposed for detecting violations of safety properties from apparently successful executions of multithreaded programs. Specifically, we provide an algorithm to monitor ...

    application/pdf

    application/pdfPDF (208Kb)
  • Oezer, Tuna (2008-02)
    This research presents a novel method for learning the lexical semantics of action verbs. The primary focus is on actions that are directed towards objects, such as kicking a ball or pushing a chair. Specifically, this ...

    application/pdf

    application/pdfPDF (2Mb)
  • Rosu, Grigore (2005-08)
    By adding the complement operator (\neg), extended regular expressions ({\ERE}) can encode regular languages non-elementarily more succinctly than regular expressions. The {\ERE} membership problem asks whether a word w ...

    application/pdf

    application/pdfPDF (228Kb)
  • Shi, Lin (2006-06)
    During the past decade, due to rapidly growing computational power, complicated numerical algorithms have become popular in graphics community which greatly improved the quality of graphics imagery. On the other hand, to ...

    application/pdf

    application/pdfPDF (26Mb)
  • Cai, Deng; He, Xiaofei; Han, Jiawei (2007-08)
    Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection vectors are commonly obtained by maximizing the between class covariance and simultaneously ...

    application/pdf

    application/pdfPDF (197Kb)
  • Alber, David Michael (2007-05)
    Solving partial differential equations (PDEs) using analytical techniques is intractable for all but the simplest problems. Many computational approaches to approximate solutions to PDEs yield large systems of linear ...

    application/pdf

    application/pdfPDF (4Mb)
  • Chang, Allan; Amir, Eyal (2005-11)
    We present new algorithms for learning a logical model of actions' effects and preconditions in partially observable domains. The algorithms maintain a logical representation of the set of possible action models after each ...

    application/pdf

    application/pdfPDF (197Kb)
  • Vardhan, Abhay; Viswanathan, Mahesh (2005-08)
    We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of ...

    application/pdf

    application/pdfPDF (232Kb)
  • Cai, Deng; He, Xiaofei; Han, Jiawei (2006-04)
    Most of the existing learning algorithms take vectors as their input data. A function is then learned in such a vector space for classification, clustering, or dimensionality reduction. However, in some situations, there ...

    application/pdf

    application/pdfPDF (185Kb)
  • Amir, Eyal; Russell, Stuart (2005-05)
    Filtering denotes any method whereby an agent updates its belief state - its knowledge of the state of the world - from a sequence of actions and observations. In logical filtering, the belief state is a logical formula ...

    application/pdf

    application/pdfPDF (325Kb)
  • Pellizzoni, Rodolfo; Caccamo, Marco (2006-03)
    Resource reclaiming schemes are applied in reservation-based real-time uniprocessor systems to support efficient reclaiming and sharing of computational resources left unused by early completing tasks, improving the response ...

    application/pdf

    application/pdfPDF (202Kb)
  • Agarwal, Shivani; Roth, Dan (2003-12)
    We develop an approach for automatically learning the optimal feature transformation for a given classification problem. The approach is based on extending the principle of risk minimization (RM), commonly used for learning ...

    application/pdf

    application/pdfPDF (243Kb)
  • Conner, William G.; Nahrstedt, Klara (2008-07)
    As Internet telephony systems continue to replace existing Public Switched Telephone Network systems, proxy servers running the Session Initiation Protocol (SIP) will continue to grow in importance for Voice-over-IP ...

    application/pdf

    application/pdfPDF (102Kb)
  • Pae, Sung-il (2005-05)
    We study random number generation using a biased source motivated by previous works on this topic, mainly, von Neumman (1951), Elias (1972), Knuth and Yao (1976) and Peres (1992). We study the problem in two cases: first, ...

    application/pdf

    application/pdfPDF (500Kb)
  • Cheng, Peng (2005-08)
    Kinodynamic and nonholonomic planning problems have differential constraints which restrict admissible velocities and accelerations of robotic systems. Since these differential constraints are ignored in the path planning ...

    application/pdf

    application/pdfPDF (2Mb)
  • Bunde, David Pattison (2006-07)
    We present algorithms and hardness results for three resource allocation problems. The first is an abstract admission control problem where the system receives a series of requests and wants to satisfy as many as possible, ...

    application/pdf

    application/pdfPDF (498Kb)
  • Cai, Deng; He, Xiaofei; Han, Jiawei (2007-05)
    Spectral methods have recently emerged as a powerful tool for dimensionality reduction and manifold learning. These methods use information contained in the eigenvectors of a data affinity (\ie, item-item similarity) matrix ...

    application/pdf

    application/pdfPDF (273Kb)
  • Cai, Deng; He, Xiaofei; Han, Jiawei (2007-05)
    Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection functions of LDA are commonly obtained by maximizing the between class covariance and ...

    application/pdf

    application/pdfPDF (249Kb)
  • Xue, Yuan; Cui, Yi; Nahrstedt, Klara (2005-06)
    Energy efficient routing is a critical problem in multihop wireless networks due to the severe power constraint of wireless nodes. Despite its importance and many research efforts towards it, a distributed routing algorithm ...

    application/pdf

    application/pdfPDF (159Kb)