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:

  • 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., ...
  • Rinard, Martin C. (2005-01)
    Memory errors are a common cause of incorrect software execution and security vulnerabilities. We have developed two new techniques that help software continue to execute successfully through memory errors: failure-oblivious ...
  • CaracaÅŸ, Alexandru (2004-01)
    We introduce Serial Append, a new parallel file I/O mode well suited for parallel applications. Serial Append allows parallel applications to efficiently perform file I/O in parallel while maintaining a structure that makes ...
  • Cheng, David R.; Shah, Viral; Gilbert, John R.; Edelman, Alan (2005-01)
    We consider the often-studied problem of sorting, for a parallel computer. Given an input array distributed evenly over p processors, the task is to compute the sorted output array, also distributed over the p processors. ...
  • Firat, Aykut; Madnick, Stuart E.; Grosof, Benjamin (2003-01)
    While there are efforts to establish a single international accounting standard, there are strong current and future needs to handle heterogeneous accounting methods and systems. We advocate a context-based approach to ...
  • Jayasena, Sajindra Kolitha Bandara; Bressan, Stéphane; Madnick, Stuart E. (2005-01)
    Each player in the financial industry, each bank, stock exchange, government agency, or insurance company operates its own financial information system or systems. By its very nature, financial information, like 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 ...
  • Eisemann, Elmar; Durand, Frédo (2005-01)
    We enhance photographs shot in dark environments by combining a picture taken with the available light and one taken with the flash. We preserve the ambiance of the original lighting and insert the sharpness from the flash ...
  • 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 ...
  • Zhu, Hongwei; Madnick, Stuart E.; Siegel, Michael D. (2003-01)
    Web aggregation has been available regionally for several years, but this service has not been offered globally. As an example, using multiple regional comparison aggregators, we analyze the global prices for a Sony ...
  • Wang, Xianbing; Teo, Yong Meng (2006-01)
    Existing Global Data Computation (GDC) protocols for asynchronous systems are designed for fully connected networks. In this paper, we discuss GDC in a dedicated asynchronous chordal ring, a type of un-fully connected ...
  • 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 ...
MIT-Mirage