means, K-medoids, Single Link, Complete Link, Average Link, and Cluster-based Similarity Partitioning Algorithm (CSPA) aredifferent efficient algorithms used for clustering documents. To find the number of clusters…
networks because it doesn’t have predefined infrastructure. Since most dynamic networks have frequent partitions with fading nodes and joining/leaving nodes, a distributed and self-managed mechanism is required…
different methods for encoding the wavelet-based images. In this project, the SPIHT (Set Partitioning in Hierarchical Trees) algorithm is an efficient method for segmenting the Region of Interest
means is the well known and most familiar algorithm among the other partition based clustering algorithms. It typically shows spectacular results even in significantly massive information sets of Image segmentation
exchange or complexation. The adsorption mechanism of the PAHs is due to partition action. No obvious competitive adsorption was found between Pb2+ and phenanthrene in coexistence system
millstone event in biomedical research. Chromatographic separation is based on the principles of adsorption, partition, ion exchange, molecular exclusion, affinity and Chirality. There are many types of chromatography…
potential could be made through extending grain filling and thereby improve resource capture and partitioning. However the model predicted an increase in frequency of heat stress at around flowering. Controlled
similarity between uncertain objects and developing efficient computational methods. The existing methods extend traditional partitioning clustering methods like k-means and density-based clustering methods like DBSCAN…
introduces a better load balance model for the public cloud based on the cloud partition concept with a switch mechanism to choose different strategies for different situations. The algorithm applies
Clustering can be defined as the process of partitioning a set of patterns into disjoint and homogeneous meaningful groups, called clusters. The growing need for distributed clustering algorithms is attributed
malathion) and less toxic ones. These pesticides have a wide range of octanol-water partitioning coefficient (Kow, log P) values (-0.8 - 6.6), which may result in a variety of storage
capacities. In summary, with this simple genetic manipulation it is possible to optimize carbon partitioning and trigger agriculturally relevant phenotypes that would allow small farmers to grow crops more reliably
ATPS have been attempted to extract Erythromycin, Lincomycin, Spiramycin, Tea saponin, Stevioside, Demeclocycline, with partition coefficient of 0.0103, 15.89, 12.71, 30.34, 11.54 and 0.084, respectively. These ATPS…
tafluprost than for bimatoprost. The log(EB) values correlated with solute octanol:water partition coefficient (logP) values, indicating that hydrophobic interactions are important in controlling solute partitioning…
group size. In order to overcome problems such as performance degradation or network partition, data can be replicated in mobile nodes. The replicas ensure that the performance is not degraded
real time scenarios like battlefield, wildlife tracking sensors nodes usually suffer from frequent network partitions. In these scenarios, there is no end to end path exists between source and destination
satisfying m-privacy. We consider the collaborative data publishing problem for anonym zing horizontally partitioned data at multiple data providers. We consider a new type of “insider attack” by colluding
nodes while selecting routes which leads to early exhaustion of nodes and partitioning of the network. This paper attempts to provide an energy aware routing algorithm. The proposed algorithm finds
could not only accelerate the hydrate formation process, but also increase the partition coefficient of methane between hydrate and vapor drastically. The paper then describes our experimental observations
researches on narrow and mixture sizes fraction of coarse coal slime with subtle partition were conducted, a series behavioral parameter values of coarse coal slime’s separation in TBSwere summarized
dynamic topology and high mobility. Due to unstable connectivity, high mobility and network partitioning, information routing in VANETs becomes difficult and challenging, thus creating a need for efficient VANET routing
phase approach to find the clusters. In the first phase, it uses a graph partitioning algorithm to cluster the data items into several relatively small sub-clusters. In the second
cost, an Anonymous Location-based Efficient Routing protocol (ALERT) is proposed. ALERT dynamically partitions the network field into zones and randomly chooses nodes in zones as intermediate relay nodes, which
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.