DSpace Repository

Browsing by Title

Browsing by Title

Sort by: Order: Results:

  • C K Yuen; M D Feng; K K Fong (1995-07-01)
    The parallel language BaLinda Lisp is presented in an alternative form taking on an appearance closer to C. The language combines features of functional and sequential execution models. Examples of different applications ...
  • TEH, Yee Whye (2006-02-02)
    Interpolated Kneser-Ney is one of the best smoothing methods for n-gram language models. Previous explanations for its superiority have been based on intuitive and empirical justifications of specific properties of the ...
  • Chuan Heng ANG; Tuck Choy TAN (1999-05-01)
    Bitmap R-tree is a variant of R-tree in which bitmaps are used for the description of the internal and the external regions of the objects in addition to the use of minimum bounding rectangles. The proposed scheme increases ...
  • Anthony H Dekker (1994-08-01)
    In this paper we present a Boehm Tree model for the Lazy Lambda Calculus with constants, which extends Abramsky's pure Lazy Lambda Calculus. The Lazy Lambda Calculus with constants forms a basis for modern lazy functional ...
  • KHOO, Siau-Cheng; ANDERSON, Hugh (2005-08-03)
    The size-change principle devised by Lee, Jones and Ben-Amram, provides an effective method of determining program termination for recursive functions over well-founded types. In this paper, we extend size-change termination ...
  • 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 ...
  • 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, ...

Search DSpace

Browse

My Account