Sciweavers

874 search results - page 78 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
AAAI
2010
13 years 9 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 2 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
IPPS
2007
IEEE
14 years 2 months ago
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
Björn Andersson, Eduardo Tovar
CVPR
2010
IEEE
14 years 3 months ago
Outlier Removal Using Duality
In this paper we consider the problem of outlier removal for large scale multiview reconstruction problems. An efficient and very popular method for this task is RANSAC. However, a...
Carl Olsson, Anders Eriksson, Richard Hartley
GECCO
2005
Springer
178views Optimization» more  GECCO 2005»
14 years 1 months ago
A co-evolutionary hybrid algorithm for multi-objective optimization of gene regulatory network models
In this paper, the parameters of a genetic network for rice flowering time control have been estimated using a multiobjective genetic algorithm approach. We have modified the rece...
Praveen Koduru, Sanjoy Das, Stephen Welch, Judith ...