DSpace Repository

# Browsing by Title

Sort by: Order: Results:

• (2013-05-21)
We propose an algorithm for detecting communities in networks. The algorithm exploits degree and clustering coefficient of vertices as we hypothesize that these metrics characterize dense connections indicative of a ...
• (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 ...
• (2005-08-25)
We demonstrate the usefulness of the uniform resource locator (URL)alone in performing web page classification. This approach is magnitudes faster than typical web page classification, as the pages themselves do not have ...
• (1993-01-01)
The redundancy in image representation can be classifed into two categories: local redundancy and global redundancy. The local redundancy corresponds to the local smoothness in the image which is due to the property that ...
• (1999-05-01)
Filtered linear hashing is a combination of linear hashing and filtered hashing. It expands the file gracefully as linear hashing, and organizes the overflow buckets with the use of a filter buffer to ensure that any bucket ...
• (1996-07-01)
Abstract not available.
• (2000-11-01)
Sampling is a useful means to handling large data sets in data mining. Given a data set and a learning algorithm, an Optimal Sample Size (OSS) can be approximately found by progressively increasing sample size until the ...
• (2008-06-19)
Existing 3D clustering algorithms on $gene\times sample\times time$ expression data do not consider the \emph{time lags} between correlated gene expression patterns. Besides, they either ignore the correlation on \emph{time ...
• (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 ...
• (2013-05-21)
In this paper, we propose a graph-layout based method for detecting communities in networks. We first project the graph onto a Euclidean space using Fruchterman-Reingold algorithm, a force-based graph drawing algorithm. ...
• (2004-02-01)
Complex Semantic Web (SW) services may have intricate data state, autonomous process behavior and concurrent interactions. The design of such SW service systems requires precise and powerful modelling techniques to capture ...
• (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 ...
• (2010-03-30)
Many record matching problems involve information that is insufficient or incomplete, and thus solutions that classify which pairs of records are matches often involve acquiring additional information at some cost. For ...
• (1997-04-01)
Abstract not available.
• (1992-06-01)
Abstract not available.
• (1999-09-01)
With large amounts of data being available to machine learning community, the need to design techniques that scale well is more critical than ever before. As some data may be collected over long periods, there is also a ...
• (2007-01-04)
Mechanized generation of prototypes from high-level specifications has long been an ultimate challenge for software engineering. One high-level specification of great interest is scenario-based sequence diagrams. Sequence ...
• (2005-07-04)
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process a twig query based on region encoding ...
• (1994-10-01)
Reuse through application generators has been successful in area of programming language systems. Can reuse practice in other domains benefit from these experiences? Companies usually start reuse at code level, by building ...
• (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 ...