Browse Dept. of Computer Science by Title

  • Do, Quang (2012-09-18)
    In this thesis, we study the importance of background knowledge in relation extraction systems. We not only demonstrate the benefits of leveraging background knowledge to improve the systems' performance but also propose ...

    application/pdf

    application/pdfPDF (614Kb)
  • Kloder, Stephen (2008-05)
    In this work, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We give methods for complete barrier coverage in a two-dimensional ...

    application/pdf

    application/pdfPDF (4Mb)
  • Cook, Diane Joyce (1990)
    This thesis addresses the problem of efficiently selecting base cases for problem-solving analogies. The base selection task is one of the most severe limitations in current analogical reasoning systems, because of the ...

    application/pdf

    application/pdfPDF (7Mb)Restricted to U of Illinois
  • Capitanu, Boris; Chan, Ellick M.; Gupta, Indranil (2005-04)
    The emergence of tiny computers, such as smart dust, Berkeley motes and Intel motes, makes it feasible to envision the conversion of a network of tiny computers into a regular computing device (i.e., a "PC" or personal ...

    application/pdf

    application/pdfPDF (162Kb)
  • Popescu, Andrei; Rosu, Grigore (2005-05)
    We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ib, which captures formally and abstractly the intuitions of adding support for behavioral equivalence and ...

    application/pdf

    application/pdfPDF (332Kb)
  • Jayachandran, Praveen; Ganti, Raghu K.; Gupta, Indranil; Abdelzaher, Tarek F. (2006-11)
    Sensor networks pose the challenge of distribution of content generated within the network to the origins of requests for this content in an efficient and timely manner. In this paper, we formulate this multiple-source ...

    application/pdf

    application/pdfPDF (308Kb)
  • Tao, Tao; Zhai, ChengXiang (2006-08)
    As exploratory queries become more and more popular, the study of how to select k items based on fuzzy matching and ranking of database tuples (i.e. top-k queries) has attracted much attention recently. However, taking the ...

    application/pdf

    application/pdfPDF (199Kb)
  • Mirarab, Siavash; Bayzid, Md Shamsuzzoha; Boussau, Bastien; Warnow, Tandy (2014)

    application/octet-stream

    application/octet-streamUnknown (677Kb)
  • Mirarab, Siavash; Bayzid, Md Shamsuzzoha; Boussau, Bastien; Warnow, Tandy (2014)

    application/zip

    application/zipZIP (1Mb)
  • Michelotti, Matthew (2013-02-03)
    Gillespie's Stochastic Simulation Algorithm (SSA) is an exact procedure for simulating the evolution of a collection of discrete, interacting entities, such as coalescing aerosol particles or reacting chemical species. ...

    application/pdf

    application/pdfPDF (547Kb)
  • Mirarab, Siavash; Bayzid, Md Shamsuzzoha; Boussau, Bastien; Warnow, Tandy (2014)

    application/zip

    application/zipZIP (11Mb)
  • Mirarab, Siavash; Bayzid, Md Shamsuzzoha; Boussau, Bastien; Warnow, Tandy (2014)

    application/zip

    application/zipZIP (25Mb)
  • Tasharofi, Samira; Pradel, Michael; Lin, Yu; Johnson, Ralph E. (2013-05)
    Actor programs are concurrent programs where concurrent entities communicate asynchronously by exchanging messages. Testing actor programs is challenging because the order of message receives depends on the non-deterministic ...

    application/pdf

    application/pdfPDF (309Kb)
  • Park, Young-Tack (1993)
    The scheduler is an key component of a blackboard system architecture. This thesis addressed the important problem of how to make the blackboard scheduler more knowledge intensive in a way that facilitates the acquisition, ...

    application/pdf

    application/pdfPDF (7Mb)Restricted to U of Illinois
  • Lee, Daeshik (1991)
    An efficient method has been developed for the fast solution of the boundary problems of Poisson's equation on irregular as well as regular domains. The method, called the boundary method-based domain decomposition or BMDD, ...

    application/pdf

    application/pdfPDF (5Mb)Restricted to U of Illinois
  • Sobeih, Ahmed A.; Viswanathan, Mahesh; Hou, Jennifer C. (2005-04)
    Network simulators perform well in evaluating the performance of network protocols, but lack the capability of verifying their correctness. In order to address this lacuna, we have extended the J- Sim network simulator ...

    application/pdf

    application/pdfPDF (185Kb)
  • Verma, Abhishek; Zea, Nicolas; Cho, Brian; Gupta, Indranil; Campbell, Roy H. (2010-01-19)
    The MapReduce model uses a barrier between the Map and Reduce stages. This provides simplicity in both programming and implementation. However, in many situations, this barrier hurts performance because it is overly ...

    application/pdf

    application/pdfPDF (256Kb)
  • Wei, Mingliang; Snir, Marc; Torrellas, Josep; Tremaine, R. Brett (2005-02)
    The Near Memory Processor (NMP) is a multithreaded vector processor integrated with the memory controller. The NMP works subordinately upon requests from the main processors. The NMP is complementary to the conventional ...

    application/pdf

    application/pdfPDF (108Kb)
  • Dankel, Douglas Duane, Ii (1980)
    Consider the tasks of trying to find similarities between the causes of the crashes of several aircraft of a common type, the causes or early warning signs for various diseases, the characteristics of stocks with high ...

    application/pdf

    application/pdfPDF (10Mb)Restricted to U of Illinois
  • Fesehaye, Debessay (2010-08-24)
    Any network communication system involves finding a path (routing) and controlling the rate (transport) of communication. Existing routing techniques lack an efficient routing metric which reflects the up-to-date status ...

    application/pdf

    application/pdfPDF (157Kb)