DSpace at NUS School of Computing: Recent submissions

  • TANG, Ruiming; CHENG, Reynold; WU, Huayu; BRESSAN, Stephane (2012-01-25)
    We propose a framework for representing conditioned probabilistic relational data. In this framework the existence of tuples in possible worlds is determined by Boolean expressions composed from elementary events. The ...
  • BÖHME, Marcel; ROYCHOUDHURY, Abhik (2011-11-08)
    Test Suite Augmentation (TSA) is based on the assumption that an existing test suite T already determines whether a program P works properly. When P evolves to P0, a comprehensive set of test cases that witness the changed ...
  • LY, Duy Khang; SUGIYAMA, Kazunari; LIN, Ziheng; KAN, Min-Yen (2011-10-07)
    Product review nowadays has become an important source of information, not only for customers to find opinions about products easily and share their reviews with peers, but also for product manufacturers to get feedback ...
  • JU, Lei; SENGUPTA, Bikram; ROYCHOUDHURY, Abhik (2011-10-06)
    A multi-tenant software as a service (SaaS) system has to meet the needs of several tenant organizations, which connect to the system to utilize its services. To leverage economies of scale through re-use, a SaaS vendor ...
  • ZHOU, Junfeng; BAO, Zhifeng; WANG, Wei; TOK, Wang Ling; CHEN, Ziyang; LIN, Xudong; GUO, Jingfeng (2011-07-21)
    In this paper, we focus on efficient keyword query processing on XML data based on SLCA and ELCA semantics. We have an elaborate design of the keyword inverted list to efficiently locate the nodes that directly or indirectly ...
  • NGUYEN, Anh Cuong; KHOO, Siau-Cheng (2011-07-12)
    Specification mining techniques are used to automatically infer interaction specifications among objects in the format of call sequences, but many of these specifications can be meaningless or insignificant. As a consequence, ...
  • TANG, Ruiming; WU, Huayu; NOBARI, Sadegh; BRESSAN, Stephane (2011-06-03)
    We propose an efficient algorithm for computing of the edit distance between an XML document and a probabilistic XML document. Probabilistic XML is a hierarchical data model capturing uncertainty of both value and structure. ...
  • LE, Thuy Ngoc; WU, Huayu; LING, Tok wang; LI, Luochen (2011-05-30)
    Most keyword search approaches for data-centric XML documents are based on the computation of Lowest Common Ancestors (LCA), such as SLCA and MLCA. In this paper, we show that the LCA is not always a correct search model ...
  • GANGADHARAN, Deepak; PHAN, Linh T.X.; CHAKRABORTY, Samarjit; ZIMMERMANN, Roger; LEE, Insup (2011-06-16)
    We study the impact of video frame drops in bufferconstrained multiprocessor system-on-chip (MPSoC) platforms. Since on-chip buffer memory occupies a significant amount of silicon area, accurate buffer sizing has attracted ...
  • TANG, Ruiming; WU, Huayu; BRESSAN, Stephane (2011-06-03)
    XML is semi-structured. It can be used to annotate unstructured data, to represent structured data and almost anything in-between. Yet, it is unclear how to formally characterize, yet to quantify, structuredness of XML. ...
  • Chattopadhyay, Sudipta; Roychoudhury, Abhik (2011-05-20)
    Abstractâ Hard real time systems require absolute guarantees in their execution times. Subsequently, worst case execution time (WCET) has increasingly become an important problem. However, performance enhancing features ...
  • ZHAO, Feng; ZHANG, Xiaolong; TUNG, Anthony K. H.; CHEN, Gang (2011-03-21)
    Keyword search in databases has received a lot of attention in the database community as it is an effective approach for querying a database without knowing its underlying schema. However, keyword search queries often ...
  • QI, Dawei; NGUYEN, Hoang D. T.; ROYCHOUDHURY, Abhik (2011-03-17)
    Efficient program path exploration is important for many software engineering activities such as testing, debugging and verification. However, enumerating all paths of a program is prohibitively expensive. In this paper, ...
  • YU, Haifeng; GIBBONS, Phillip B.; SHI, Chenwei (2011-02-07)
    A key and well-known problem in large-scale collaborative distributed systems is how to incentivize the rational/selfish users so that they will properly collaborate. Within such context, this paper focuses on designing ...
  • TAY, Y. C.; DAI, Bingtian; WANG, Tao; SUN, Yang; LIN, Yong; LIN, Yuting (2010-12-17)
    This paper presents UpSizeR, a software that takes as input an empirical relational dataset D and a scale factor s, and generates a synthetic dataset e D' that is similar to D but s times its size. Such a tool can be useful ...
  • TSAI, Ming-Feng; NAKOV, Preslav; NG, Hwee Tou (2010-12-27)
    In statistical machine translation, word-to-word probabilities are usually difficult to estimate because of the problem of data sparseness, especially for resource-poor languages. Furthermore, this problem would become ...
  • HUYNH, Bach Khoa; JU, Lei; ROYCHOUDHURY, Abhik (2010-10-28)
    Caches are widely used in modern computer systems to bridge the increasing gap between processor speed and memory access time. On the other hand, the presence of caches, especially data caches, complicates the static worst ...
  • JU, Lei; BANERJEE, Ansuman; ROYCHOUDHURY, Abhik; SENGUPTA, Bikram (2010-10-28)
    A multi-tenant software as a service (SaaS) system has to meet the needs of several tenant organizations, which connect to the system to utilize its services. To leverage economies of scale through reuse, a SaaS vendor ...
  • WANG, Aobo; HOANG, Cong Duy Vu; KAN, Min-Yen (2010-07-27)
    Crowdsourcing has emerged as a new method for obtaining annotations for training models for machine learning. While many variants of this process exist, they largely differ in their method of motivating subjects to ...
  • WU, Huayu; LING, Tok Wang; Bao, Zhifeng; XU, Liang (2010-07-22)
    Keyword search is a user-friendly way to query XML data. Existing LCA-based XML keyword search approaches assign a Dewey ID to every document node and find the relevant LCA nodes of the query keywords based on the Dewey ...

Search DSpace

Browse

My Account