DSpace at MIT
(28,129 recursos)
This site is a university repository providing access to the publication output of the institution. Registered users can set up email alerts to notify them of newly added relevant content. A certain level of encryption and security is embedded in the site which may cause some users accessibility problems.
42.
Hardware Transactional Memory - Lie, Sean; Asanovic, Krste; Kuszmaul, Bradley C.; Leiserson, Charles E.
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.
45.
MATLAB*G: A Grid-Based Parallel MATLAB - Chen, Ying; Tan, Suan Fong
This paper describes the design and implementation of MATLAB*G, a parallel MATLAB on the ALiCE Grid.
47.
A New Constructive Method for the One-Letter Context-Free Grammars - Andrei, Å?tefan; Chin, Wei Ngan
Constructive methods for obtaining the regular grammar counterparts for some sub-classes of the context free grammars (cfg) have been investigated by many researchers.
49.
On Web Taxonomy Integration - Zhang, Dell; Lee, Wee Sun
We address the problem of integrating objects from a source taxonomy into a master taxonomy.
52.
Region Type Checking for Core-Java - Chin, Wei Ngan; Qin, Shengchao; Rinard, Martin C.
Region-based memory management offers several important advantages over garbage-collected heap, including real-time performance, better data locality and efficient use of limited memory.
56.
Learning object boundary detection from motion data - Ross, Michael G.; Kaelbling, Leslie P.
This paper describes the initial results of a project to create a self-supervised algorithm for learning object segmentation from video data.
57.
Ameliorating the Overhead of Dynamic Optimization - Zhao, Qin; Wong, Weng Fai
However, it has a significant disadvantage viz-a-viz traditional static optimization: it has a significant runtime overhead.
58.
Bit-Width Analysis for General Applications - Ding, Yang; Wong, Weng Fai
Bit-width analysis targets at finding the minimum bits needed for each variable in the program, which ensures the execution correctness and resources saving.