DSpace Repository

Browsing Technical Reports by Title

Browsing Technical Reports by Title

Sort by: Order: Results:

  • CAO, Jianneng; KISTER, Thomas; XIANG, Shili; MALHOTRA, Baljeet; TAN, Wee-Juan; TAN, Kian-Lee; BRESSAN, Stéphane (2013-02-08)
    The International Maritime Organization (IMO) requires a majority of cargo and passenger ships to use the Automatic Identification System (AIS) for navigation safety and traffic control. Distributing live AIS data on the ...
  • Indra Budi; Stephane Bressan (2003-06-01)
    We propose a new name entity class recognition method based on association rules. We evaluate and compare the performance of our method with the state of the art maximum entropy method. We show that our method consistently ...
  • Tay B H; Koh E K; Ananda A L (1992-04-01)
    Abstract not available.
  • WANG, Tao; ROYCHOUDHURY, Abhik (2005-06-15)
    Localizing the cause(s) of an observable error lies at the heart of program debugging. Fault localization often proceeds by comparing the failing program run with some ``successful'' run (a run which does not demonstrate ...
  • ZHANG, Bingjun; WANG, Ye (2009-07-03)
    Violin practice in a home environment, where there is often no teacher available, can benefit from automatic music transcription to provide feedback to the student. This paper describes a high performance violin transcription ...
  • BAO, Zhifeng; LU, Jiaheng; LING, Tok Wang; MENG, Xiaofeng (2009-06-23)
    Existing XML keyword search methods focus on how to find relevant and meaningful data fragments for a keyword query, assuming each keyword is intended as part of it. However, user's queries usually contain irrelevant or ...
  • 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.

Search DSpace


Browse

My Account