Browse by Subject "algorithms"

  • Zimak, Dav A. (2006-05)
    Classification problems in machine learning involve assigning labels to various kinds of output types, from single assignment binary and multi-class classification to more complex assignments such as category ranking, ...

    application/pdf

    application/pdfPDF (942Kb)
  • Chen, Ke (2007-10)
    We present algorithms for three geometric problems -- clustering, orienteering, and conflict-free coloring. In the first part, we obtain small coresets for k-median and k-means clustering in general metric spaces and ...

    application/pdf

    application/pdfPDF (835Kb)
  • Hu, Chunyu; Kim, Hwangnam; Hou, Jennifer C. (2005-07)
    In the paper, we perform an in-depth analytic study of the binary exponential algorithm (BEBA) that is widely used in distributed MAC protocols, for example, IEEE 802.11 DCF. We begin with a generalized framework of modeling ...

    application/pdf

    application/pdfPDF (215Kb)
  • Korula, Nitish J. (2010-08-20)
    This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic ...

    application/pdf

    application/pdfPDF (1Mb)
  • Pongthawornkamol, Thadpong; Gupta, Indranil (2006-05)
    Today's large-scale distributed systems consist of a collection of nodes that have highly variable availability . a phenomenon sometimes called churn. This availability variation is often a hindrance to achieving reliability ...

    application/pdf

    application/pdfPDF (231Kb)
  • 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)
  • Chiu, Ming-Ching (University of Illinois, 2014-04)
    Computer-assisted algorithmic music composition has achieved great success in the past few decades. Composing this kind of music makes the composers think about music in a new way. Research on applying artificial intelligence ...

    application/pdf

    application/pdfPDF (2Mb)Restricted to U of Illinois
  • Kannan, Aswin (2010-05-18)
    The focus of this research is on the analysis and computation of equilibria in noncooperative Cournot and Bertrand games. The application of focus for Cournot competition is power markets while that for Bertrand competition is ...

    application/pdf

    application/pdfPDF (938Kb)