Browse Research and Tech Reports - Computer Science by Title

  • Zelinka, Stephen David (2005-05)
    Modelling by example has arisen as a powerful paradigm for reducing the artistic skill required for computer graphics. Instead of relying on the user's own modelling skills, a system that models by example allows users to ...

    application/pdf

    application/pdfPDF (79Mb)
  • Wang, Qiyan (2011-04)

    application/pdf

    application/pdfPDF (867Kb)
  • Uddin, Md Yusuf Sarwar; Amin, Md Tanvir Al; Abdelzaher, Tarek F.; Iyengar, Arun; Govindan, Ramesh (2012-04-25)
    This paper addresses the problem of collection and delivery of a representative subset of pictures, in participatory camera networks, to maximize coverage when a significant portion of the pictures may be redundant or ...

    application/pdf

    application/pdfPDF (504Kb)
  • Cui, Yi; Li, Baochun; Nahrstedt, Klara (2004-04)
    In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split the traffic and feed them into multiple ...

    application/pdf

    application/pdfPDF (953Kb)
  • Lim, Jongwoo (2005-12)
    The images of an object may look very different under different illumination conditions or viewing directions. This thesis considers the problem of clustering images of various objects into disjoint subsets according to ...

    application/pdf

    application/pdfPDF (8Mb)
  • O'Kane, Jason M.; LaValle, Steven M. (2006-11)
    Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing and actuation abilities are needed to complete ...

    application/pdf

    application/pdfPDF (354Kb)
  • Ilseman, Michael; Ellison, Chucky M.; Rosu, Grigore (2010-12-14)
    This paper describes a completely automated method for generating efficient and competitive interpreters from formal semantics expressed in Rewriting Logic. The semantics are compiled into OCaml code, which then acts as ...

    application/pdf

    application/pdfPDF (257Kb)
  • Zhang, Honghai (2004-02)
    In this paper, we explore the fundamental limits of sensor network lifetime that all algorithms can possibly achieve. Specifically, under the assumptions that nodes are deployed as a Poisson point process with density ...

    application/pdf

    application/pdfPDF (399Kb)
  • Harris III, Albert F.; Snader, Robin; Kravets, Robin (2006-06)
    Increases in computing capabilities of mobile devices have led to the use of multimedia applications that have high processor and bandwidth resource requirements, each of which consume significant energy. However, battery ...

    application/pdf

    application/pdfPDF (304Kb)
  • Li, Chien-Wei (2006-05)
    To efficiently utilize the emerging heterogeneous multi-core architecture, it is essential to exploit the inherent coarse-grained parallelism in applications. In addition to data parallelism, applications like telecommunication, ...

    application/pdf

    application/pdfPDF (1Mb)
  • application/pdf

    application/pdfPDF (264Kb)
  • Jain, Nikhil; Bhatele, Abhinav; Yeom, Jae-Seung; Adams, Mark F.; Miniati, Francesco; Mei, Chao; Kale, Laxmikant (2014-08-26)
    Modern parallel codes are often written as a collection of several diverse modules. Different programming languages might be the best or natural fit for each of these modules or for different libraries that are used together ...

    application/pdf

    application/pdfPDF (311Kb)
  • Rosu, Grigore (2007-02)
    Various definitions of safety properties as sets of execution traces have been introduced in the literature, some over finite traces, others over infinite traces, yet others over both finite and infinite traces. By employing ...

    application/pdf

    application/pdfPDF (388Kb)
  • Saremi, Fatemeh; Jayachandran, Praveen; Iandola, Forrest; Uddin, Md Yusuf Sarwar; Abdelzaher, Tarek F. (2011-07)
    This paper develops a framework to analyze the latency and delay composition of workflows in a real-time networked aggregation system. These workflows are characterized by different inputs that are processed along parallel ...

    application/pdf

    application/pdfPDF (349Kb)
  • Sen, Koushik; Viswanathan, Mahesh; Agha, Gul A. (2004-12)
    Statistical methods to model check stochastic systems have been, thus far, developed only for a sublogic of continuous stochastic logic (CSL) that does not have steady state operators and unbounded until formulas. In this ...

    application/pdf

    application/pdfPDF (230Kb)
  • Saremi, Fatemeh; Gupta, Indranil (2011)
    Disruption-Tolerant Networks (DTNs) enable transfer of data when network nodes are only intermittently connected. With respect to the scarcity of connectivity in DTNs, a key research challenge is to guarantee schedulability ...

    application/pdf

    application/pdfPDF (373Kb)
  • Zhang, Honghai; Hou, Jennifer C. (2005-04)
    In this paper we study the asymptotic minimum energy required to transport (via multiple hops) data packets from a source to a destination. Under the assumptions that nodes are distributed according to a Poisson point ...

    application/pdf

    application/pdfPDF (182Kb)
  • Duran, Francisco; Meseguer, José (2010-11-03)
    In the effort to bring rewriting-based methods into contact with practical applications, both in programing and in formal verification, there is a tension between: (i) expressiveness and generality —so that a wide range ...

    application/pdf

    application/pdfPDF (478Kb)
  • Francisco Duran and Jose Meseguer (Elsevier, 2012-06-27)
    In the effort to bring rewriting-based methods into contact with practical applications both in programing and in formal verification, there is a tension between: (i) expressiveness and generality---so that a wide range ...

    application/pdf

    application/pdfPDF (492Kb)
  • Hendrix, Joe; Meseguer, Jose (2007-02)
    We propose three different notions of completeness for term rewrite specifications supporting order-sorted signatures, deduction modulo axioms, and context-sensitive rewriting relative to a replacement map mu. Our three ...

    application/pdf

    application/pdfPDF (439Kb)