Sciweavers

1248 search results - page 123 / 250
» Decision Tree Grafting
Sort
View
WG
1998
Springer
15 years 9 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
ICRA
2000
IEEE
121views Robotics» more  ICRA 2000»
15 years 8 months ago
Using Multiple Gaussian Hypotheses to Represent Probability Distributions for Mobile Robot Localization
A new mobile robot localization technique is presented which uses multiple Gaussian hypotheses to represent the probability distribution of the robots location in the environment....
David J. Austin, Patric Jensfelt
IJCAI
2007
15 years 6 months ago
Occam's Razor Just Got Sharper
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
Saher Esmeir, Shaul Markovitch
ICASSP
2010
IEEE
15 years 4 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
ICCAD
1995
IEEE
129views Hardware» more  ICCAD 1995»
15 years 8 months ago
Activity-driven clock design for low power circuits
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...
Gustavo E. Téllez, Amir H. Farrahi, Majid S...