DSpace Repository

Browsing Technical Reports by Title

Browsing Technical Reports by Title

Sort by: Order: Results:

  • Sunil, KOTHARI; Martin, SULZMANN (2005-02-16)
    This article presents an in-depth study of the close connection between Haskell type classes and C++ template/traits mechanism - two different facilties for implementing generic programming concepts. Haskell type classes ...
  • Stan Jarzabek; Riri Huang (1997-09-01)
    Abstract not available.
  • Stan JARZABEK; Riri Huang (1996-09-01)
    Abstract not available.
  • CAO, Jianneng; CARMINATI, Barbara; FERRARI, Elena; TAN, Kian Lee (2008-02-26)
    Most of existing privacy preserving techniques such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are continuous, transient and usually unbounded. Moreover, ...
  • Hsu L S; Wu ZhiBiao (1992-03-01)
    Abstract not available.
  • Mong Li LEE; Hongjun LU; Tok Wang LING; Yee Teng KO (1999-06-01)
    Given the rapid growth of data, it is increasingly important to extract, mine and discover useful information from databases and data warehouses. The process of data cleansing or data scrubbing is crucial because of the ...
  • Paul Kang Hoh Phua (1995-01-01)
    Two combined quasi-newton algorithms QNSW1 and QNSW2 are proposed in this paper. These algorithms are developed based on the eigenvalues of matrices which are inertial to the symmetric rank-one (SR1) updates and the BFGS ...
  • Phua K H; Rudy Setiono (1992-11-01)
    Abstract not available.
  • LUCA, Beatrice; KHOO, Siau-Cheng (2005-02-07)
    We present a comparison between two smoothing techniques for forecasting time series, Minimal Distance Percentage Principle (MDPP) and non-parametric Kernel Regression. This comparison reveals some important aspects such ...
  • LI, Guoliang; LEONG, Tze-Yun; ZHANG, Louxin (2006-09-08)
    Missing values in the microarray data are problematic in many biological applications. In literature, different methods have been proposed to estimate the missing values, and their performances are evaluated with the ...
  • M D FENG; W F WONG; C K YUEN (1995-02-01)
    There is a commonly held idea that although Lisp is a good language for prototyping and software development, it is often too inefficient to be useful in actual implementation. Advances in compiling Lisp have begun to ...
  • STEPHAN, Frank (2007-02-28)
    Let C and H denote the plain and prefix-free Kolmogorov complexity, respectively. Then the sets NRC of nonrandom numbers with respect to C has neither a maximal nor an r-maximal superset. The set of NRH of nonrandom numbers ...
  • 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 ...
  • KHOUSSAINOV, Bakhadyr; STEPHAN, Frank; YANG, Yue (2007-08-31)
    In this paper, the notions of F[alpha]-categorical and G[alpha]-categorical structures are introduced by choosing the isomorphism such that the function itself or its graph sits on the alpha-th level of the Ershov hierarchy, ...
  • Aravind Srinivasan; David Zucherman (1996-04-01)
    We study how to run randomized algorithms when the source of randomness is very defective (weak). For any fixed epsilon > 0, we show how to simulate RP algorithms in time n^{O(log n)} using the output of a delta-source ...
  • Stan Jarzabek; Tang Siong Tiing (1994-08-01)
    Conceptual models must be sometimes built for a family of software systems rather than for a single system. Situations when this happens include evolutionary software development, software reengineering and reuse. In all ...
  • 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 ...
  • 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, ...
  • 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 ...
  • Tay Seng Chuan; Teo Yong Meng (1994-06-01)
    Multistage interconnection networks are used in a number of application areas such as parallel computers and high-speed communication systems. As the performance of these systems lies on an efficient design of the ...

Search DSpace


Browse

My Account