Sciweavers

2740 search results - page 72 / 548
» Approximating Component Selection
Sort
View
IPCO
2008
129views Optimization» more  IPCO 2008»
14 years 11 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
IPL
2008
105views more  IPL 2008»
14 years 10 months ago
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
Mario A. Lopez, Shlomo Reisner
JMLR
2010
129views more  JMLR 2010»
14 years 4 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
ICC
2008
IEEE
127views Communications» more  ICC 2008»
15 years 4 months ago
Pre-Equalization and Precoding Design for Frequency-Selective Fading Channels
— In this paper, we consider the joint transmitter and receiver design problem based on a novel approximate maximum likelihood decision feedback equalizer (A-ML-DFE) over frequen...
Lingyang Song, Are Hjørungnes, Manav R. Bha...
IJCAI
2007
14 years 11 months ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...