DSpace at NUS School of Computing: Recent submissions

  • JAHJA, Irvan; YU, Haifeng; ZHAO, Yuda
    This paper considers several closely-related problems in synchronous dynamic networks with oblivious adversaries, and proves novel (d + poly(m)) lower bounds on their time complexity (in terms of rounds). Here d is the ...
  • LIU, Qing; BASU, Debabrota; GOEL, Shruti; ABDESSALEM, Talel; BRESSANE, Stéphane (2017-06-06)
    One of the modern pillars of collaborative filtering and recommender systems is collection and exploitation of ratings from users. Likert scale is a psychometric quantifi er of ratings popular among the electronic commerce ...
  • BASU, Debabrota; WANG, Xiayang; HONG, Yang; CHEN, Haibo; BRESSAN, Stéphane (2017-04-04)
    Cloud providers leverage live migration of virtual machines to reduce energy consumption and allocate resources efficiently in data centers. Each migration decision depends on three questions: when to move a virtual machine, ...
  • NGUYEN, Manh-Dung; DONG, Naipeng; ROYCHOUDHURY, Abhik (2017-01-25)
    Security is a big concern in widely adopting security critical systems, such as Unmanned Aerial Vehicles (UAV). To ensure security of a system, the rst step is to identify the required security properties as well as the ...
  • LIU, Qing; BASU, Debabrota; ABDESSALEM, Talel; BRESSAN, Stephane (2016-09-03)
    Modern recommendation systems leverage some forms of collaborative user or crowd sourced collection of information. For instance, services like TripAdvisor, Airbnb and HungyGoWhere rely on user-generated content to describe ...
  • YU, Haifeng; ZHAO, Yuda; JAHJA, Irvan (2016-04-25)
    For dynamic networks with unknown diameter, we prove novel lower bounds on the time complexity of a range of basic distributed computing problems. Together with trivial upper bounds under dynamic networks with known diameter ...
  • ZHOU, Jingbo; GUO, Qi; JAGADISH, H. V.; LUAN, Wenhao; TUNG, Anthony K. H.; ZHENG, Yuxin (2015-11-23)
    Data variety, as one of the three Vs of the Big Data, is manifested by a growing number of complex data types such as documents, sequences, trees, graphs and high dimensional vectors. To perform similarity search on these ...
  • Zhong, ZENG; Mong Li, Lee; Tok Wang, Ling (2015-07-08)
    Keyword search over relational databases has gained popularity as it provides a user-friendly way to explore structured data. Current research has focused on the computation of minimal units that contain all the query ...
  • LIU, Qing; LUO, Tie; TANG, Ruiming; BRESSAN, Stephane (2014-10-20)
    In a crowdsourcing market, a requester is looking to form a team of workers to perform a complex task that requires a variety of skills. Candidate workers advertise their certified skills and bid prices for their participation. ...
  • ZUO, Zhiqiang; KHOO, Siau-Cheng (2014-07-14)
    Cooperative statistical bug isolation approaches monitor program runtime behavior from end-user executions and apply statistical techniques to pinpoint likely causes of eld failures. Having end-users to run fully instrumented ...
  • GAO, Ziyuan; STEPHAN, Frank (2014-07-10)
    Partial learning is a criterion where the learner in nitely often outputs one correct conjecture while every other hypothesis is issued only nitely often. This paper addresses two variants of partial learning in the setting ...
  • JAIN, Sanjay; KÖTZING, Timo; MA, Junqi; STEPHAN, Frank (2014-07-10)
    The present work investigates the relationship of iterative learning with other learning criteria such as decisiveness, caution, reliability, non-U-shapedness, monotonicity, strong monotonicity and conservativeness. Building ...
  • LE, Thuy Ngoc; BAO, Zhifeng; LING, Tok Wang (2014-06-24)
    XML keyword search has attracted a lot of interests with typical search based on lowest common ancestor (LCA). However, in this paper, we show that meaningful answers can be found beyond LCA and should be independent from ...
  • ZHAO, Yuda; YU, Haifeng; CHEN, Binbin (2014-05-31)
    This paper considers the problem of computing general commutative and associative aggregate functions (such as SUM) over distributed inputs held by nodes in a distributed system, while tolerating failures. Specifically, ...
  • MILEA, Narcisa Andreea; JIANG, Lingxiao; KHOO, Siau-Cheng (2014-03-28)
    Automated techniques have been proposed to either identify refactoring opportunities (i.e., code fragments that can, but have not yet been restructured in a program), or reconstruct historical refactoring (i.e., code ...
  • CAVALCANTI, Ana; ALBERTI, Francesco; DENMAN, William; FILHO, M.S. Conserva; GUI, Lin; NGUYEN, Thien Binh; QUAN, Thanh Tho; NGUYEN, Minh Hai; NGUYEN, Huu Vu; NGUYEN, Cong Dinh; SETYAUTAMI, Maya Retno Ayu (2014-05-30)
    Preface This volume contains the papers presented at the Doctoral Symposium which was held in Singapore on 13 May 2014 as part of the International Symposium on Formal Methods (FM2014). The Doctoral Symposium is an important ...
  • TANG, Ruiming; AMARILLI, Antoine; SENELLART, Pierre; BRESSAN, Stéphane (2014-03-12)
    While price and data quality should define the major tradeoff for consumers in data markets, prices are usually prescribed by vendors and data quality is not negotiable. In this paper we study a model where data quality ...
  • TANG, Ruiming; SHAO, Dongxu; BA, M. Lamine; WU, Huayu (2014-03-12)
    A probabilistic relational database is a compact form of a set of deterministic relational databases (namely, possible worlds), each of which has a probability. In our framework, the existence of tuples is determined by ...
  • CHEN, Liang; MITRA, Tulia (2013-06-18)
    Coarse-grained reconfigurable arrays (CGRAs) exhibit high performance, improved flexibility, low cost, and power efficiency for various application domains. Computeintensive loop kernels are mapped onto CGRAs through ...
  • Tang, Ruiming; Shao, Dongxu; Ba, M. Lamine; Senellart, Pierre; Bressan, Stéphane (2013-10-24)
    A probabilistic database instance denotes a set of possible non-probabilistic database instances called possible worlds, each of which has a probability. This is often a compact way to represent uncertain data. In addition, ...

Search DSpace

Browse

My Account