Sciweavers

6546 search results - page 476 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
IJCAI
2001
15 years 8 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
JAIR
2006
92views more  JAIR 2006»
15 years 6 months ago
Dynamic Local Search for the Maximum Clique Problem
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
Wayne J. Pullan, Holger H. Hoos
ICIP
2009
IEEE
15 years 4 months ago
An automatic Structure-Aware image extrapolation applied to error concealment
A novel framework for spatially estimating unknown image data is presented. Common applications include inpainting, concealment of transmission errors, prediction in video coding,...
Haricharan Lakshman, Patrick Ndjiki-Nya, Martin K&...
INTERSPEECH
2010
15 years 1 months ago
Combining many alignments for speech to speech translation
Alignment combination (symmetrization) has been shown to be useful for improving Machine Translation (MT) models. Most existing alignment combination techniques are based on heuri...
Sameer Maskey, Steven J. Rennie, Bowen Zhou
ICCV
2011
IEEE
14 years 6 months ago
Optimizing Polynomial Solvers for Minimal Geometry Problems
In recent years polynomial solvers based on algebraic geometry techniques, and specifically the action matrix method, have become popular for solving minimal problems in computer...
Oleg Naroditsky, Kostas Daniilidis