686 Result(s)
within
English
Computer Science
Information Storage and Retrieval
**u Tao
Chapter
-
Chapter and Conference Paper
Alignment of trees — An alternative to tree edit
In this paper, we propose the alignment of trees as a measure of the similarity between two labeled trees. Both ordered and unordered trees are considered. An algorithm is designed for ordered trees. The time com...
-
Chapter and Conference Paper
On the complexity of comparing evolutionary trees
We study the computational complexity and approximation of several problems arising in the comparison of evolutionary trees. It is shown that the maximum agreement subtree (MAST) problem for three trees with u...
-
Chapter
The Design of Information System in Thin-Client Environment over Intranet
This paper focuses on discussing the design principles and choices of IS in new model. With the architecture of IS has transit to multi-tier Client/Server and Thin-Client environment from 2-tier Client/Server ...
-
Chapter
X.500 — Information Infrastructure of Distributed Systems in Heterogeneous Environments
Develo** distributed systems in heterogeneous environments often needs to solve the problem of how to access many different kinds of network resources, and that is a rather difficult task. In this paper, we ...
-
Chapter
A Complexity Model For Web Queries
A new complexity model for web queries is presented in this paper. The novelties of this model are: (1) the communication cost is considered; (2) the complexity of a web query is partitioned into the accessing co...
-
Chapter and Conference Paper
Mining Functional Dependency Rule of Relational Database
This paper defines a kind of rule, functional dependency rule. The functional dependency degree of relational database can be depicted by this kind of rule. We give a algorithm to mine this kind of rule and pr...
-
Chapter and Conference Paper
A Visual Method of Cluster Validation with Fastmap
This paper presents a visual method of cluster validation using the Fastmap algorithm. Two problems are tackled with Fastmap in the interactive process of discovering interesting clusters from real world datab...
-
Chapter and Conference Paper
An Interactive Approach to Building Classiffication Models by Clustering and Cluster Validation
This paper presents the decision clusters classifier (DCC) for database mining. A DCC model consists of a small set of decision clusters extracted from a tree of clusters generated by a clustering algorithm fr...
-
Chapter and Conference Paper
Association Rules
New association rules are presented for measure of association relationships between patterns. The new association rules are shown to not only measure three well-known association relationships correctly, but ...
-
Chapter and Conference Paper
The Longest Common Subsequence Problem for Arc-Annotated Sequences
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. Recently, the longest arc-preserving common subsequence problem has been introduced in [[6],[7]] as a fr...
-
Chapter and Conference Paper
The Incompressibility Method
Kolmogorov complexity is a modern notion of randomness dealing with the quantity of information in individual objects; that is, pointwise randomness rather than average randomness as produced by a random sourc...
-
Chapter and Conference Paper
Validating an Access Cost Model for Wide Area Applications
In this paper, we describe a case study in develo** an access cost model for WebSources in the context of a wrapper mediator architecture. We document our experiences in validating this model, and note succe...
-
Chapter and Conference Paper
Efficient OLAP Operations in Spatial Data Warehouses
Spatial databases store information about the position of individual objects in space. In many applications however, such as traffic supervision or mobile communications, only summarized data, like the number ...
-
Chapter and Conference Paper
Estimating Joint Probabilities from Marginal Ones*
Estimating joint probabilities plays an important role in many data mining and machine learning tasks. In this paper we introduce two methods, minAB and prodAB, to estimate joint probabilities. Both methods are b...
-
Chapter and Conference Paper
CoFD: An Algorithm for Non-distance Based Clustering in High Dimensional Spaces*
The clustering problem, which aims at identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity clusters, has been widely studied. T...
-
Chapter and Conference Paper
Quantization Watermarking Schemes for MPEG-4 General Audio Coding
Quantization Watermarking or Quantization Index Modulation is usually used for uniform scalar quantizarion. In this article, the Quantizaion Watermarking extendedly refers to all the watermarking schemes that ...
-
Chapter and Conference Paper
A Bayesian Method for Content-Based Image Retrieval by Use of Relevance Feedback
This paper proposes a new Bayesian method for content-based image retrieval using relevance feedback. In this method, the problem of contentbased image retrieval is first formulated as a two-class classificati...
-
Chapter and Conference Paper
Aggregate Processing of Planar Points
Aggregate window queries return summarized information about objects that fall inside a query rectangle (e.g., the number of objects instead of their concrete ids). Traditional approaches for processing such q...
-
Chapter and Conference Paper
Objectionable Image Recognition System in Compression Domain
In this paper, we propose an intelligent recognition system for objectionable image in JPEG compression domain. First, the system applies robust skin color model and skin texture analysis to detect the skin re...
-
Chapter and Conference Paper
Site-Role Based GreedyDual-Size Replacement Algorithm
Web caching is an effective Web performance enhancement technique that has been used widely. Web caching aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popula...
