Browse Research and Tech Reports - Computer Science by Title

  • 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)
  • Zelenko, Dmitry (2003-12)
    The dissertation presents a number of novel machine learning techniques and applies them to information extraction. The study addresses several information extraction subtasks: part of speech tagging, entity extraction, ...

    application/pdf

    application/pdfPDF (921Kb)
  • Li, Xiaoming (2006-08)
    The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is often the only choice since the code generated ...

    application/pdf

    application/pdfPDF (857Kb)
  • Cozzie, Anthony E.; King, Samuel (2012-08-27)
    Current natural language programming systems avoid the difficulties of dealing with abstract and ambiguous concepts by restricting the input words to those comparable to a normal high-level programming language. Our system, ...

    application/pdf

    application/pdfPDF (893Kb)
  • Lattner, Chris A. (2005-05)
    Providing high performance for pointer-intensive programs on modern architectures is an increasingly difficult problem for compilers. Pointer-intensive programs are often bound by memory latency and cache performance, but ...

    application/pdf

    application/pdfPDF (2Mb)
  • Marco Cesati; Renato Mancuso; Emiliano Betti; Marco Caccamo (2015-06-18)
    Tools for memory access detection are widely used, playing an important role especially in real-time systems. For example, on multi-core platforms, the problem of co-scheduling CPU and memory resources with hard real-time ...

    application/pdf

    application/pdfPDF (399Kb)
  • 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)
  • He, Bin; Chang, Kevin Chen-Chuan (2004-07)
    With the prevalence of databases on the Web, \emph{large scale} integration has become a pressing problem. As an essential task, \emph{holistic schema matching} (i.e., discovering attribute correspondences among many ...

    application/pdf

    application/pdfPDF (304Kb)
  • Biehl, Jacob T. (2004-01)
    By enabling users to better manage information across PDAs, laptops, graphics tablets, and large screens, the use of an interactive space could dramatically improve how users share information in collaborative work. To ...

    application/pdf

    application/pdfPDF (415Kb)
  • 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)
  • Tovar, Benjamin; Freda, Luigi; LaValle, Steven M. (2006-08)
    This paper considers a robot that moves in the plane and is only able to sense the cyclic order of landmarks with respect to its current position. No metric information (e.g., coordinates) is available regarding the robot ...

    application/pdf

    application/pdfPDF (244Kb)
  • Yershova, Anna; Tovar, Benjamin; Ghrist, Robert; LaValle, Steven M. (2009-04-16)
    This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse the interior of the environment only when ...

    application/pdf

    application/pdfPDF (274Kb)
  • Vu, Long; Gupta, Indranil; Liang, Jin; Nahrstedt, Klara (2006-08)
    While several deployed p2p file sharing overlays have been characterized in the literature, this paper shows that some of their conclusions may be false for p2p applications that stream media instead. Specifically, we ...

    application/pdf

    application/pdfPDF (330Kb)
  • Chen, Kai; Yang, Zhenyu; Wagener, Christian; Nahrstedt, Klara (2005-01)
    Multihop wireless hotspot network has been recently proposed to extend the coverage area of a base station. However, with selfish nodes in the network, multihop packet forwarding cannot take place without an incentive ...

    application/pdf

    application/pdfPDF (160Kb)
  • 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)
  • 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)
  • Rosu, Grigore (2011-11-16)
    Matching logic allows to specify structural properties about program configurations by means of special formulae, called patterns, and to reason about them by means of pattern matching. This paper proposes rewriting ...

    application/pdf

    application/pdfPDF (285Kb)
  • Rosu, Grigore (2014-01-20)
    Matching logic is a first-order logic (FOL) variant to reason about structure. Its sentences, called patterns, are constructed using variables, symbols, connectives and quantifiers, but no dif ference is made between ...

    application/pdf

    application/pdfPDF (232Kb)
  • 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)