Advanced Search
DSpace@MIT

Browsing Computer Science (CS) by Issue Date

Research and Teaching Output of the MIT Community

Browsing Computer Science (CS) by Issue Date

Sort by: Order: Results:

  • Nigham, Anshul; Hsu, David; Latombe, Jean-Claude (2007-01)
    In this work, we propose a radical approach for exploring the space of all possible protein structures. We present techniques to explore the clash-free conformation space, which comprises all protein structures whose atoms ...
  • Ooi, Beng Chin; Yu, Bei; Li, Guoliang (2007-01)
    In this paper, we present a folksonomy-based collaborative data publishing and searching system. The system accepts data objects described with user-created metadata, called data units. The system supports flexible structure ...
  • He, Yuxiong; Hsu, Wen Jing; Leiserson, Charles E. (2007-01)
    Scheduling competing jobs on multiprocessors has always been an important issue for parallel and distributed systems. The challenge is to ensure global, system-wide efficiency while offering a level of fairness to user ...
  • Nguyen, Huu Hai; David, Cristina; Qin, Shengchao; Chin, Wei Ngan (2007-01)
    Despite their popularity and importance, pointer based programs remain a major challenge for program verification. In this paper, we propose an automated verification system that is concise, precise and expressive for ...
  • 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 ...
  • Chieu, Hai Leong (2007-01)
    The Survey Propagation (SP) algorithm [1] has recently been shown to work well in the hard region for random K-SAT problems. SP has its origins in sophisticated arguments in statistical physics, and can be derived from an ...
  • Zhao, Qin; Rabbah, Rodric; Wong, Weng Fai (2006-01)
    Heap memory allocation plays an important role in modern applications. Conventional heap allocators, however, generally ignore the underlying memory hierarchy of the system, favoring instead a low runtime overhead and fast ...
  • Jagadish, H.V.; Ooi, Beng Chin; Rinard, Martin C.; Vu, Quang Hieu (2006-01)
    We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to be made between nodes ...
  • Rinard, Martin C. (2006-01)
    Programs developed with standard techniques often fail when they encounter any of a variety of internal errors. We present a set of techniques that prevent programs from failing and instead enable them to continue to ...
  • Nguyen, Huu Hai; Rinard, Martin C. (2006-01)
    We present and evaluate a new memory management technique for eliminating memory leaks in programs with dynamic memory allocation. This technique observes the execution of the program on a sequence of training inputs to ...
  • Lim, Hock Beng; Lam, Vinh The; Foo, Mao Ching; Zeng, Yulian (2006-01)
    Wireless sensor networks have emerged as a promising technology for a wide range of important applications. A major research challenge in this field is the distributed resource allocation problem, which concerns how the ...
  • Zhu, Hongwei; Madnick, Stuart E. (2006-01)
    In this paper, we first identify semantic heterogeneities that, when not resolved, often cause serious data quality problems. We discuss the especially challenging problems of temporal and aggregational ontological ...
  • Su, Sara L.; Durand, Frédo; Agrawala, Maneesh (2006-01)
    We present a post-processing technique that selectively reduces the salience of distracting regions in an image. Computational models of attention predict that texture variation influences bottom-up attention mechanisms. ...
  • Sollins, Karen R.; Li, Ji (2006-01)
    Internet 0 is proposed as a local area network that supports extremely small network devices with very little capacity for computation, storage, or communication. Internet 0 addresses the issue of connecting very small, ...
  • Edelman, Alan; Rao, N. Raj (2006-01)
    Random matrix theory is now a big subject with applications in many disciplines of science, engineering and finance. This talk is a survey specifically oriented towards the needs and interests of a computationally inclined ...
  • Chieu, Hai Leong; Lee, Wee Sun; Kaelbling, Leslie P. (2006-01)
    We describe the application of conditional random fields (CRF) to physiological data modeling for the application of activity recognition. We use the data provided by the Physiological Data Modeling Contest (PDMC), a ...
  • Danaher, John S.; Lee, I-Ting Angelina; Leiserson, Charles E. (2006-01)
    JCilk extends the Java language to provide call-return semantics for multithreading, much as Cilk does for C. Java's built-in thread model does not support the passing of exceptions or return values from one thread back ...
  • Drake, Matthew; Hoffmann, Hank; Rabbah, Rodric; Amarasinghe, Saman P. (2006-01)
    Image and video codecs are prevalent in multimedia applications, ranging from embedded systems, to desktop computers, to high-end servers such as HDTV editing consoles. It is not uncommon however for developers create (from ...
  • Rudolph, Larry; Zhenghao, Chen (2006-01)
    Social networks have been used to understand how information flows through an organization as well as identifying individuals that appear to have control over this information flow. Such individuals are identified as being ...
  • 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 ...
MIT-Mirage