Sciweavers

172 search results - page 26 / 35
» Improved approximation for directed cut problems
Sort
View
WSCG
2004
217views more  WSCG 2004»
13 years 9 months ago
Blending Textured Images Using a Non-parametric Multiscale MRF Method
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
Bernard Tiddeman
UAI
2000
13 years 9 months ago
Adaptive Importance Sampling for Estimation in Structured Domains
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
Luis E. Ortiz, Leslie Pack Kaelbling
DCG
2008
86views more  DCG 2008»
13 years 7 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
ATAL
2010
Springer
13 years 8 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
HEURISTICS
2008
120views more  HEURISTICS 2008»
13 years 7 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti