what is the impact factor of archives of physics research? ....etc

[:=Read Full Message Here=:]

Abstract
Efficiency and scalability are fundamental issues concerning data mining in large databases. Although classification has been studied extensively, few of the known methods take serious consideration of efficient induction in large databases and the analysis of data at multiple abstraction levels. The paper addresses the efficiency and scalability issues by proposing a data classification method which integrates attribute oriented induction, relevance analysis, and the induction of decision trees. Such an integration leads to efficient ....etc

[:=Read Full Message Here=:]

Definition
The concept of light tree is introduced in a wavelength routed optical network, which employs wavelength -division multiplexing (WDM).
Depending on the underlying physical topology networks can be classified into three generations:

a).First Generation: these networks do not employ fiber optic technology; instead they employ copper-based or microwave technology. E.g. Ethernet.
b).Second Generation: these networks use optical fibers for data transmission but switching is performed in electronic domain. E.g. FDDI.
c).Third Genera ....etc

[:=Read Full Message Here=:]

A Tree Based Peer to Peer Network with Quality Gurantee

Introduction
Peer-to-peer (P2P) networks often demand scalability, low communication latency among nodes, and low system wide overhead. For scalability, a node maintains partial states of a P2P network and connects to a few nodes. For fast communication, a P2P network intends to reduce the communication latency between any two nodes as much as possible. With regard to a low system wide overhead, a P2P network minimizes its traffic in maintaining its performance efficiency and functiona ....etc

[:=Read Full Message Here=:]

Abstract:

Data mining refers to extracting or mining knowledge from large amount of data. It helps in discovering the frequent patterns. This knowledge can be help in making business decisions conventional data mining techniques were proposed to be in efficient, the source of data is incremental in nature and also they need to be re executed every time which in turn multiple database scans.

In this paper, we propose a novel data structure called CATS Tree to suit for continuously growing data sets, based on association rule mining with in ....etc

[:=Read Full Message Here=:]

ABSTRACT
The concept of a light-tree is introduced in a wavelength-routed optical network. A light-tree is a point-to-multipoint generalization of a lightpath. A lightpath is a point-to-point all-optical wavelength channel connecting a transmitter at a source node to a receiver at a destination node. Lightpath communication can significantly reduce the number of hops (or lightpaths) a packet has to traverse; and this reduction can, in turn, significantly improve the networkâ„¢s ....etc

[:=Read Full Message Here=:]

sir,

I want details of this project

(A Divide-And-Conquer Approach for Minimum Spanning Tree-Based Clustering) ....etc

[:=Read Full Message Here=:]

This paper presents a zero tree coding method for color images that uses no lists during encoding and decoding,permitting the omission of the lists requirement in Said and Pearlman's Set Partitioning In Hierarchical Trees (SPIHT) algorithm . Without the lists, the memory requirement in a VLSI implementation is reduced significantly. This coding algorithm is also developed to reduce the circuit complexity of an implementation. Our experimental results show only a minor reduction of PSNR values when compared with the PSNR values obtained by th ....etc

[:=Read Full Message Here=:]

please send more information about topic ....etc

[:=Read Full Message Here=:]

:heart:AN ALGORITHM FOR LABELING A TREE:heart:

KOH KHEE MENG AND TAY ENG GUAN

Abstract. An algorithm is described for labeling the vertices of a tree. A tree can then be determined by the collection of labels of its vertices, listed in lexicographic order.


1. Introduction

The notion of distance degree sequences of graphs was studied by Randic for the purpose of distinguishing chemical isomers by their graph structures. Other sequences for this purpose have also been proposed and discussed. The objective and hope is to deve ....etc

[:=Read Full Message Here=:]