Sciweavers

2880 search results - page 228 / 576
» Approximate Range Searching
Sort
View
NIPS
2003
15 years 5 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
123
Voted
ICASSP
2010
IEEE
15 years 4 months ago
An adaptive level of detail approach to nonlinear estimation
In this work, we present a general method for approximating nonlinear transformations of Gaussian mixture random variables. It is based on transforming the individual Gaussians wi...
Friedrich Faubel, Dietrich Klakow
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 4 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter
INFORMS
2008
241views more  INFORMS 2008»
15 years 4 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
JCO
2006
153views more  JCO 2006»
15 years 4 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong