• No results found

Tree-based

An Efficient Image Steganography Scheme using Tree Based Parity Check

An Efficient Image Steganography Scheme using Tree Based Parity Check

... ABSTRACT: Steganography is the practice of data hiding within some other information. The important fact is that the existence of the message is known only to the recipient. The data can be hided in different media such ...

8

Comparing performance of non–tree based and tree based association mapping methods

Comparing performance of non–tree based and tree based association mapping methods

... Both the pooled t-test and the LSS (with a maximum of k = 15 clusters) were used to analyze systolic blood pres- sure using 5 genes from the 200 simulated phenotype data sets. All loci in all replicates chose far fewer ...

6

Forest Stand Types Classification Using Tree-Based Algorithms and SPOT-HRG Data

Forest Stand Types Classification Using Tree-Based Algorithms and SPOT-HRG Data

... and tree-based algorithms i.e. the Classification and Regression Tree (CART), Boosting Regression Tree (BRT) and Random Forest (RF) for general forest type mapping using semi high resolution ...

16

Virtual Screening of Drug Likeness using Tree Based Ensemble Classifier

Virtual Screening of Drug Likeness using Tree Based Ensemble Classifier

... In earlier years, the Drug discovery process took years to identify and process a Drug. It takes a normal of 12 years for a Drug to travel from the research lab to the patient. With the introduction of Machine Learning ...

7

Hyper Quad Tree based K Means Clustering Algorithm for Fault Prediction

Hyper Quad Tree based K Means Clustering Algorithm for Fault Prediction

... quad tree based k-means algorithm for software fault ...Quad Tree as compared to Quad Tree. Hyper quad tree works in n-dimensions hence it finds better initial cluster centers than ...

5

Topics in Tree-Based Methods

Topics in Tree-Based Methods

... to tree-based methods, Chapter 3 describes Individual Conditional Expectation (ICE) plots, a methodology for visualizing the model estimated by any supervised learning ...

112

An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System

An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System

... leaves. Based on this declustering strategy, a new R*-tree based semi-dynamic parallel join algorithm and two versions of the existing clone join algorithm were ...

103

Efficient Tree Based Topic Modeling

Efficient Tree Based Topic Modeling

... One of LDA’s virtues is that it is a simple model that assumes a symmetric Dirichlet prior over its word distributions. Recent work argues for structured distributions that constrain clusters (Andrzejewski et al., 2009), ...

5

Resizable  Tree-Based  Oblivious  RAM

Resizable Tree-Based Oblivious RAM

... We are the first to show how to dynamically resize constant-client memory tree-based Oblivious RAM. This allows for use cases where clients do not know in advance exactly how much storage they will need ...

20

Tree based Indexing for DHT based P2P Systems

Tree based Indexing for DHT based P2P Systems

... Nowadays, DHT-based P2P technology is used as a basis in many wide spread applications because of its scalability, robustness, and load balance. Many applications, including file sharing, communication and live ...

7

Interactive, tree-based graph visualization

Interactive, tree-based graph visualization

... spanning tree rooted at the selected vertex is extracted from the graph using breadth-first ...graph based on this spanning tree, and then uses animation to transition from the full graph drawing to ...

73

On Tree Based Neural Sentence Modeling

On Tree Based Neural Sentence Modeling

... trivial tree based LSTMs perform the best among all models, we draw two hypotheses, which are i) right-branching tree benefits a lot from strong structural priors; ii) balanced tree wins ...

11

Unsupervised Tree Induction for Tree based Translation

Unsupervised Tree Induction for Tree based Translation

... most tree-based translation models are built directly from parse ...unsupervised tree structure derived from a novel non-parametric Bayesian ...synchronous tree substitution grammars (STSG) to ...

12

Tree based Hybrid Machine Translation

Tree based Hybrid Machine Translation

... generation tree and target- side SCFG tree are aligned and form the basis for computing structural similar- ...and based on this alignment, sub- trees are substituted to create more accu- rate ...and ...

10

User preference tree based personalized online learning managment system

User preference tree based personalized online learning managment system

... items based on the matching of their attributes to the user ...rate based on each individual criterion in multicriteria ...content- based recommender consists of matching up the attributes of a user ...

7

User preference tree based personalized online learning  managment system

User preference tree based personalized online learning managment system

... document based on their preference because the preference should be of any type like pdf, ppt, word document, text document, image and video To overcome the problem of WD-FIM it should be combined with User ...

7

Syntactic Tree based Relation Extraction Using a Generalization of Collins and Duffy Convolution Tree Kernel

Syntactic Tree based Relation Extraction Using a Generalization of Collins and Duffy Convolution Tree Kernel

... syntactic tree kernel is proposed that generally measures the syntactic similarity between parse ...convolution tree kernel is proposed by associating generic weights to the nodes and sub-trees of the parse ...

6

Performance Analysis on Uncertain Data using Decision Tree

Performance Analysis on Uncertain Data using Decision Tree

... decision tree for data classification and it widely used on certain or precise ...decision tree based classification method on uncertain ...decision tree algorithms by including entropy and ...

5

Performance Analysis of Decision Tree Algorithms on Mushroom Dataset

Performance Analysis of Decision Tree Algorithms on Mushroom Dataset

... Hoeffding Tree: Hoeffding trees were introduced by Domingos and Hutten in high speed data ...Decision Tree leaner .The Hoeffding tree algorithm is the basic theoretical algorithm, while VFDT ...

11

Efficient Collective Communication for Multi-core NOC Interconnects

Efficient Collective Communication for Multi-core NOC Interconnects

... loosely based on spanning binomial trees. Another tree based multicast scheme is proposed in ...(QBM) tree for transmitting multicast messages. A QBM tree is a logic tree rooted ...

57

Show all 10000 documents...

Related subjects