Sciweavers

530 search results - page 11 / 106
» Bounds on marginal probability distributions
Sort
View
EPEW
2006
Springer
13 years 11 months ago
Explicit Inverse Characterizations of Acyclic MAPs of Second Order
This paper shows how to construct a Markovian arrival process of second order from information on the marginal distribution and on its autocorrelation function. More precisely, clo...
Armin Heindl, Gábor Horváth, Karsten...
ICRA
2000
IEEE
121views Robotics» more  ICRA 2000»
13 years 11 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
COLT
2003
Springer
14 years 1 months ago
Maximum Margin Algorithms with Boolean Kernels
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
Roni Khardon, Rocco A. Servedio
VLSM
2005
Springer
14 years 1 months ago
Entropy Controlled Gauss-Markov Random Measure Field Models for Early Vision
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
Mariano Rivera, Omar Ocegueda, José L. Marr...
NIPS
2007
13 years 9 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...