Sciweavers

2553 search results - page 103 / 511
» Modeling Trees with Hypertextures
Sort
View
IPPS
1998
IEEE
15 years 2 months ago
A Survey of Randomness and Parallelism in Comparison Problems
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
Danny Krizanc
ICASSP
2010
IEEE
14 years 10 months ago
Language model adaptation using Random Forests
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
Anoop Deoras, Frederick Jelinek, Yi Su
ENDM
2010
110views more  ENDM 2010»
14 years 10 months ago
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
Ivana Ljubic, Stefan Gollowitzer
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 4 months ago
Predicting Future Decision Trees from Evolving Data
Recognizing and analyzing change is an important human virtue because it enables us to anticipate future scenarios and thus allows us to act pro-actively. One approach to understa...
Mirko Böttcher, Martin Spott, Rudolf Kruse
ISM
2008
IEEE
83views Multimedia» more  ISM 2008»
15 years 4 months ago
Fast and Flexible Tree Rendering with Enhanced Visibility Estimation
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
Jessy Lee, C. C. Jay Kuo