Advanced Search
DSpace@MIT

Browsing Computer Science (CS) by Title

Research and Teaching Output of the MIT Community

Browsing Computer Science (CS) by Title

Sort by: Order: Results:

  • Lie, Sean; Asanovic, Krste; Kuszmaul, Bradley C.; Leiserson, Charles E. (2004-01)
    This work shows how hardware transactional memory (HTM) can be implemented to support transactions of arbitrarily large size, while ensuring that small transactions run efficiently. Our implementation handles small ...
  • Xiong, Xuejian; Wong, Weng Fai; Hsu, Wen Jing (2003-01)
    The recent development of DNA microarray technology is creating a wealth of gene expression data. Typically these datasets have high dimensionality and a lot of varieties. Analysis of DNA microarray expression data is a ...
  • Zhao, Qin; Amarasinghe, Saman P.; Rabbah, Rodric M.; Rudolph, Larry; Wong, Weng Fai (2007-01)
    Application debugging is a tedious but inevitable chore in any software development project. An effective debugger can make programmers more productive by allowing them to pause execution and inspect the state of the ...
  • Hsiao, Kaijen; Lozano-Pérez, Tomás (2006-01)
    Humans often learn to manipulate objects by observing other people. In much the same way, robots can use imitation learning to pick up useful skills. A system is detailed here for using imitation learning to teach a robot ...
  • Madnick, Stuart E. (2004-01)
    Data quality issues have taken on increasing importance in recent years. In our research, we have discovered that many “data quality” problems are actually “data misinterpretation” problems – that is, problems with data ...
  • Larsen, Samuel; Witchel, Emmett; Amarasinghe, Saman P. (2003-01)
    A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence information at compile-time enables new classes ...
  • Andrei, Åžtefan; Chin, Wei Ngan; Rinard, Martin C. (2005-01)
    Testing constraints for real-time systems are usually verified through the satisfiability of propositional formulae. In this paper, we propose an alternative where the verification of timing constraints can be done by ...
  • Zhu, Hongwei; Madnick, Stuart E.; Siegel, Michael D. (2003-01)
    The development of web technology has led to the emergence of web aggregation, a service that collects existing web data and turns them into more useful information. We review the development of both comparison and ...
  • Peng, Bing; Wong, Weng Fai; Tay, Yong Chiang (2005-01)
    Caches are known to consume up to half of all system power in embedded processors. Co-optimizing performance and power of the cache subsystems is therefore an important step in the design of embedded systems, especially ...
  • Yu, Bei; Liu, Ling; Ooi, Beng Chin; Tan, Kian Lee (2006-01)
    Information integration has been widely addressed over the last several decades. However, it is far from solved due to the complexity of resolving schema and data heterogeneities. In this paper, we propose out attempt to ...
  • Yu, Bei; Liu, Ling; Ooi, Beng Chin; Tan, Kian Lee (2005-01)
    In this paper, we present a P2P-based database sharing system that provides information sharing capabilities through keyword-based search techniques. Our system requires neither a global schema nor schema mappings between ...
  • Firat, Aykut; Madnick, Stuart E.; Grosof, Benjamin (2003-01)
    The shift towards global networking brings with it many opportunities and challenges. In this paper, we discuss key technologies in achieving global semantic interoperability among heterogeneous information systems, including ...
  • Ross, Michael G.; Kaelbling, Leslie P. (2004-01)
    This paper describes the initial results of a project to create a self-supervised algorithm for learning object segmentation from video data. Developmental psychology and computational experience have demonstrated that the ...
  • Ross, Michael G.; Kaelbling, Leslie P. (2003-01)
    A significant barrier to applying the techniques of machine learning to the domain of object boundary detection is the need to obtain a large database of correctly labeled examples. Inspired by developmental psychology, ...
  • Kaelbling, Leslie P.; Lozano-Pérez, Tomás (2005-01)
    Artifacts made by humans, such as items of furniture and houses, exhibit an enormous amount of variability in shape. In this paper, we concentrate on models of the shapes of objects that are made up of fixed collections ...
  • Wang, Xianbing; Teo, Yong Meng; Cao, Jiannong (2005-01)
    In this paper, we discuss the consensus problem for synchronous distributed systems with orderly crash failures. For a synchronous distributed system of n processes with up to t crash failures and f failures actually occur, ...
  • Pan, Yan; Hsu, Wen Jing (2004-01)
    Many parallel programming languages allow programmers to describe parallelism by using constructs such as fork/join. When executed, such programs can be modeled as directed graphs, with nodes representing a computation and ...
  • Chiu, Han-Pang; Lozano-Pérez, Tomás (2005-01)
    We present a new method to perform reliable matching between different images. This method exploits a projective invariant property between concentric circles and the corresponding projected ellipses to find complete region ...
  • Chen, Ying; Tan, Suan Fong (2004-01)
    This paper describes the design and implementation of MATLAB*G, a parallel MATLAB on the ALiCE Grid. ALiCE (Adaptive and scaLable internet-based Computing Engine), developed at NUS, is a lightweight grid-computing middleware. ...
  • Choy, Ron; Edelman, Alan (2003-01)
    MATLAB is one of the most widely used mathematical computing environments in technical computing. It is an interactive environment that provides high performance computational routines and an easy-to-use, C-like scripting ...
MIT-Mirage