Browse by Subject "computer science"

  • Zhang, Zhen (2006-12)
    The Web has been rapidly ``deepened'' by myriad searchable databases online, where data are hidden behind query interfaces. Guarding data behind them, such query interfaces are the ``entrances'' or ``doors'' to the deep ...

    application/pdf

    application/pdfPDF (2Mb)
  • Wang, Shun; de Sturler, Eric; Paulino, Glaucio H. (2006-01)
    The computational bottleneck of topology optimization is the solution of a large number of linear systems arising in the finite element analysis. We propose fast iterative solvers for large three-dimensional topology ...

    application/pdf

    application/pdfPDF (4Mb)
  • Baugh, Lee W.; Zilles, Craig (2006-05)
    Transactional memory (TM) is a compelling alternative to traditional synchronization, and implementing TM primitives directly in hardware offers a potential performance advantage over software-based methods. In this paper, ...

    application/pdf

    application/pdfPDF (200Kb)
  • Kushal, Akash M. (2008-10)
    This dissertation addresses the task of detecting instances of object categories in photographs. We propose modeling an object category as a collection of object parts linked together in a deformable configuration. We ...

    application/pdf

    application/pdfPDF (10Mb)
  • McHenry, Kenton Guadron (2008-04)
    This dissertation addresses the task of learning to segment images into meaningful material and object categories. With regards to materials we consider the difficult task of segmenting objects made of transparent materials ...

    application/pdf

    application/pdfPDF (7Mb)
  • 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)
  • Vardhan, Abhay (2006-02)
    Making high quality and reliable software systems remains a difficult problem. One approach to address this problem is automated verification which attempts to demonstrate algorithmically that a software system meets its ...

    application/pdf

    application/pdfPDF (872Kb)
  • Iqbal, Shamsi T.; Bailey, Brian P. (2005-09)
    A challenge in building interruption reasoning systems is to compute an accurate cost of interruption (COI). Prior work has used non task-specific cues to predict COI, but ignore characteristics related to the /structure/ ...

    application/pdf

    application/pdfPDF (215Kb)
  • Srinivasan, Jayanth (2006-05)
    Ensuring long-term, or ``lifetime'' reliability, as dictated by the hard error rate due to wear-out based failures, is a critical requirement for microprocessor manufacturers. At the same time, the steady increases in CMOS ...

    application/pdf

    application/pdfPDF (1Mb)
  • Lazebnik, Svetlana (2006-04)
    This dissertation addresses the problems of recognizing textures, objects, and scenes in photographs. We present approaches to these recognition tasks that combine salient local image features with spatial relations and ...

    application/pdf

    application/pdfPDF (19Mb)
  • 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)
  • Lu, Ying; Han, Jiawei (2005-07)
    Maintaining frequency counts for data streams has attracted much interest among the research community recently since it provides the base for many stream mining applications. Most existing work followed the same paradigm: ...

    application/pdf

    application/pdfPDF (676Kb)
  • Lin, Ruei-Sung (2006-05)
    This thesis addresses the problem of learning manifold from time series. We use the mixtures of probabilistic principal component analyzers (MPPCA) to model the nonliner manifold. In addition, we extend the MPPCA model by ...

    application/pdf

    application/pdfPDF (6Mb)
  • Rosu, Grigore; Schulte, Wolfram (2009-01)
    Hoare logics rely on the fact that logic formulae can encode, or specify, program states, including environments, stacks, heaps, path conditions, data constraints, and so on. Such formula encodings tend to lose the structure ...

    application/pdf

    application/pdfPDF (477Kb)
  • Yu, Tian-Li (2006-11)
    Unlike most simple textbook examples, the real world is full with complex systems, and researchers in many different fields are often confronted by problems arising from such systems. Simple heuristics or even enumeration ...

    application/pdf

    application/pdfPDF (2Mb)
  • Serbanuta, Traian Florin; Chen, Feng; Rosu, Grigore (2008-12)
    Extracting causal models from observed executions has proved to be an effective approach to analyze concurrent programs. Most existing causal models are based on happens-before partial orders and/or Mazurkiewicz traces. ...

    application/pdf

    application/pdfPDF (431Kb)
  • Har-Peled, Sariel; Roth, Dan; Zimak, Dav A. (2006-10)
    We study the problem of learning large margin halfspaces in various settings using coresets and show that coresets are a widely applicable tool for large margin learning. A large margin coreset is a subset of the input ...

    application/pdf

    application/pdfPDF (257Kb)
  • Doan, AnHai; Li, Xin; Roth, Dan (2006-02)
    Many real-world applications increasingly involve both structured data and text. A given real-world entity is often referred to in different ways, such as ``Helen Hunt'', and ``Mrs. H. E. Hunt'', both within and across the ...

    application/pdf

    application/pdfPDF (295Kb)
  • Ramachandran, Pradeep; Adve, Sarita V.; Bose, Pradip; Rivers, Jude A.; Srinivasan, Jayanth (2006-08)
    This work concerns appropriate metrics for evaluating microarchitectural enhancements to improve processor lifetime reliability. The most commonly used reliability metric is mean time to failure (MTTF). However, MTTF does ...

    application/pdf

    application/pdfPDF (595Kb)
  • Witthawaskul, Weerasak (2006-09)
    One of the reasons enterprise software is difficult to change is because it relies on middleware services. Middleware makes the rest of the application simpler but then the application depends on the middleware. Migrating ...

    application/pdf

    application/pdfPDF (2Mb)