Sciweavers

2403 search results - page 41 / 481
» Optimal Randomized RANSAC
Sort
View
CAL
2008
14 years 12 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
Rohit Sunkam Ramanujam, Bill Lin
GECCO
2009
Springer
115views Optimization» more  GECCO 2009»
15 years 4 months ago
Benchmarking the pure random search on the BBOB-2009 testbed
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
Anne Auger, Raymond Ros
GECCO
2009
Springer
118views Optimization» more  GECCO 2009»
15 years 4 months ago
Benchmarking the pure random search on the BBOB-2009 noisy testbed
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
Anne Auger, Raymond Ros
UAI
2004
15 years 1 months ago
Exponential Families for Conditional Random Fields
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...
Yasemin Altun, Alexander J. Smola, Thomas Hofmann
CPC
2008
135views more  CPC 2008»
14 years 12 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs