Sciweavers

1923 search results - page 184 / 385
» Weighted Decision Trees
Sort
View
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 6 months ago
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
Samir Datta, Raghav Kulkarni, Sambuddha Roy
VISUALIZATION
2005
IEEE
16 years 10 hour ago
Evolutionary Morphing
We introduce a technique to visualize the gradual evolutionary change of the shapes of living things as a morph between known three-dimensional shapes. Given geometric computer mo...
David F. Wiley, Nina Amenta, Dan A. Alcantara, Deb...
ICML
2006
IEEE
16 years 7 months ago
An empirical comparison of supervised learning algorithms
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
Rich Caruana, Alexandru Niculescu-Mizil
WG
1998
Springer
15 years 10 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 10 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