Sciweavers

2403 search results - page 91 / 481
» Optimal Randomized RANSAC
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 2 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
CVPR
2005
IEEE
16 years 5 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 3 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
CEC
2005
IEEE
15 years 8 months ago
Incorporating a Metropolis method in a distribution estimation using Markov random field algorithm
Abstract- Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)...
Siddhartha Shakya, John A. W. McCall, Deryck F. Br...
NAACL
2003
15 years 4 months ago
Shallow Parsing with Conditional Random Fields
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling...
Fei Sha, Fernando C. N. Pereira