Skip to main content

previous disabled Page of 59
and
  1. No Access

    Chapter and Conference Paper

    Structure-Based Queries over the World Wide Web

    With the increasing importance of the World Wide Web as an information repository, how to locate documents of interest becomes more and more significant. The current practice is to send keywords to search engi...

    Tao Guan, Miao Liu, Lawrence V. Saxton in Conceptual Modeling – ER ’98 (1998)

  2. No Access

    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...

    **aopeng Tao, Ning Wang, Shuigeng Zhou in Methodologies for Knowledge Discovery and … (1999)

  3. No Access

    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...

    Zhexue Huang, Tao Lin in Knowledge Discovery and Data Mining. Curre… (2000)

  4. No Access

    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...

    Zhexue Huang, Michael K. Ng, Tao Lin in Intelligent Data Engineering and Automated… (2000)

  5. No Access

    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 ...

    Tao Zhang in Knowledge Discovery and Data Mining. Current Issues and New Applications (2000)

  6. No Access

    Chapter and Conference Paper

    Soft Mobile Ad-Hoc Networking

    Today’s mobile ad-hoc networking approaches require nodes to maintain network topology and routing tables, which limits network scalability. This paper proposes soft mobile ad-hoc networks in which nodes do not m...

    Tao Zhang, Wai Chen in Mobile Data Management (2001)

  7. No Access

    Chapter and Conference Paper

    Enterprise Alliance and Virtue Enterprise: A Systematic Analysis and Theoretical Explanation

    Internet enterprise organization (“EO”) with representation of enterprise alliance (“EA”) and virtue enterprise (VE) is now a prevailing form of organization in developed countries. This paper attempts to put ...

    Tao Meng, Ning Ding in The Human Society and the Internet Interne… (2001)

  8. No Access

    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...

    Vladimir Zadorozhny, Louiqa Raschid, Tao Zhan in Cooperative Information Systems (2001)

  9. No Access

    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 ...

    Dimitris Papadias, Panos Kalnis, Jun Zhang in Advances in Spatial and Temporal Databases (2001)

  10. No Access

    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...

    Tao Li, Shenghuo Zhu, Mitsunori Ogihara in Data Warehousing and Knowledge Discovery (2002)

  11. No Access

    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...

    Shenghuo Zhu, Tao Li, Mitsuonri Ogihara in Data Warehousing and Knowledge Discovery (2002)

  12. Chapter and Conference Paper

    Adjusted Probabilistic Packet Marking for IP Traceback

    Distributed denial-of-service attack is one of the greatest threats to the Internet today. One of the biggest difficulties in defending against this attack is that attackers always use incorrect, or “spoofed” ...

    Tao Peng, Christopher Leckie in NETWORKING 2002: Networking Technologies, … (2002)

  13. No Access

    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 ...

    Liu Shu-chang, Li **-tao in Advances in Multimedia Information Processing — PCM 2002 (2002)

  14. No Access

    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...

    Tao Ju-Lan, Hung Yi-** in Recent Advances in Visual Information Systems (2002)

  15. No Access

    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...

    Yufei Tao, Dimitris Papadias, Jun Zhang in Advances in Database Technology — EDBT 2002 (2002)

  16. No Access

    Chapter and Conference Paper

    A Protocol for Fast Co-Allocation of Shared Web Services

    The emerging Web services are building blocks for creating highly distributed e-Business applications, allowing any services to be integrated as long as they are Web-enabled. This interoperability allows busin...

    Jonghun Park, Tao Yang in Technologies for E-Services (2003)

  17. No Access

    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...

    **ngjun Zhang, Depei Qian, Dajun Wu, Yi Liu in Advances in Web-Age Information Management (2003)

  18. No Access

    Chapter and Conference Paper

    Exploiting Similarity of Subqueries for Complex Query Optimization

    Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing complex queries. To tackle this ch...

    Yingying Tao, Qiang Zhu, Calisto Zuzarte in Database and Expert Systems Applications (2003)

  19. No Access

    Chapter and Conference Paper

    Validity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds

    The results of traditional spatial queries (i.e., range search, nearest neighbor, etc.) are usually meaningless in spatio-temporal applications, because they will be invalidated by the movements of query and/o...

    Yufei Tao, Nikos Mamoulis, Dimitris Papadias in Advances in Spatial and Temporal Databases (2003)

  20. No Access

    Chapter and Conference Paper

    Automatically Extracting Ontologically Specified Data from HTML Tables of Unknown Structure

    Data on the Web in HTML tables is mostly structured, but we usually do not know the structure in advance. Thus, we cannot directly query for data of interest. We propose a solution to this problem based on doc...

    David W. Embley, Cui Tao, Stephen W. Liddle in Conceptual Modeling — ER 2002 (2003)

previous disabled Page of 59