Advanced Search
DSpace@MIT

Browsing Computer Science (CS) by Title

Research and Teaching Output of the MIT Community

Planned maintenance alert - Monday, April 21: DSpace@MIT will undergo maintenance activities that will affect service availability and access to file content. While the service interruptions should be brief, access to file content may take longer to restore. Status updates will be posted to http://3down.mit.edu/.

Browsing Computer Science (CS) by Title

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 ...
  • Kim, Hana; Kho, Nancy; Yan, Emily; Rudolph, Larry (2004-01)
    A speech controlled animation system is both a useful application program as well as a laboratory in which to investigate context aware applications as well as controlling errors. The user need not have prior knowledge or ...
  • Zhu, Hongwei; Madnick, Stuart E. (2005-01)
    Many online services access a large number of autonomous data sources and at the same time need to meet different user requirements. It is essential for these services to achieve semantic interoperability among these ...
  • Tan, Philip Eik Yeow; Tan, Kian Lee; Madnick, Stuart E. (2005-01)
    The COntext INterchange (COIN) strategy is an approach to solving the problem of interoperability of semantically heterogeneous data sources through context mediation. COIN has used its own notation and syntax for representing ...
  • Durand, Frédo (2004-01)
    A full-length feature film such as Pixar's Toy Story, or the award-winning educational programs such as Walking with Dinosaurs, require a production time of several years and draw on the full-time efforts of several hundred ...
  • Ng, Wee Siong; Shu, Yanfeng; Tok, Wee Hyong (2004-01)
    In this paper, we present the design and evaluation of CQ-Buddy, a peer-to-peer (p2p) continuous query (CQ) processing system that is distributed, and highly-scalable. CQ-Buddy exploits the differences in capabilities ...
  • Rinard, Martin C. (2003-01)
    This paper presents an approach to compiler correctness in which the compiler generates a proof that the transformed program correctly implements the input program. A simple proof checker can then verify that the program ...
  • Wong, Weng Fai (2003-01)
    The widely acknowledged performance gap between processors and memory has been the subject of much research. In the Explicitly Parallel Instruction Computing (EPIC) paradigm, the combination of in-order issue and the ...
  • 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, ...
  • Teo, Yong Meng; March, Verdi; Wang, Xianbing (2005-01)
    This paper presents a DHT-based grid resource indexing and discovery (DGRID) approach. With DGRID, resource-information data is stored on its own administrative domain and each domain, represented by an index server, is ...
  • Lehman, Li-wei; Lerman, Steven (2003-01)
    In many distributed applications, end hosts need to know the network locations of other nearby participating hosts in order to enhance overall performance. Potential applications that can benefit from the location information ...
  • Chen, David; Peserico, Enoch; Rudolph, Larry (2003-01)
    The effective size of an L2 cache can be increased by using a dictionary-based compression scheme. Naive application of this idea performs poorly since the data values in a cache greatly vary in their “compressibility.” ...
  • 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 ...
  • Hu, Yahong; Hsu, Wen Jing; Xu, Xiang (2004-01)
    We address the issue of shuffling loads in Automated Storage/Retrieval Systems (AS/RS) in this paper. The objective is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. ...
  • Fineman, Jeremy T. (2004-01)
    A series-parallel directed acyclic graph, or SP-dag, contains nodes that are either in series or logically in parallel. We present a data structure and algorithm to efficiently determine, in a single serial walk of the ...
  • Shen, Heng Tao; Shu, Yan Feng; Yu, Bei (2004-01)
    Most existing Peer-to-Peer (P2P) systems support only title-based searches and are limited in functionality when compared to today’s search engines. In this paper, we present the design of a distributed P2P information ...
  • Virkar, Ameya (2003-01)
    Encryption Key Search is a compute-intensive operation that consists of a brute-force search of a particular key in a given key space. Sequential execution time for a 56-bit encryption key search is approximately 200,000 ...
  • Cui, Bin; Shen, Heng Tao; Shen, Jialie; Tan, Kian Lee (2005-01)
    In this paper, we develop a novel index structure to support efficient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., ...
MIT-Mirage