Sciweavers

2553 search results - page 32 / 511
» Modeling Trees with Hypertextures
Sort
View
TOC
2008
75views more  TOC 2008»
14 years 9 months ago
A Quantum Algorithm for the Hamiltonian NAND Tree
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann
CGI
2004
IEEE
15 years 1 months ago
BlobTree Trees
In recent years several methods for modeling botanical trees have been proposed. The geometry and topology of tree skeletons can be well described by L-systems; however, there are...
Callum Galbraith, Peter MacMurchy, Brian Wyvill
ACL
2011
14 years 1 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
75
Voted
WSC
2004
14 years 11 months ago
Decision Tree Module Within Decision Support Simulation System
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
Mohamed Moussa, Janaka Y. Ruwanpura, George Jergea...
JMLR
2010
146views more  JMLR 2010»
14 years 4 months ago
Accurate Ensembles for Data Streams: Combining Restricted Hoeffding Trees using Stacking
The success of simple methods for classification shows that is is often not necessary to model complex attribute interactions to obtain good classification accuracy on practical p...
Albert Bifet, Eibe Frank, Geoffrey Holmes, Bernhar...