Sciweavers

4843 search results - page 369 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
COMGEO
2007
ACM
15 years 4 months ago
Learning smooth shapes by probing
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve ...
TNN
2008
119views more  TNN 2008»
15 years 4 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
QUESTA
2007
92views more  QUESTA 2007»
15 years 4 months ago
Estimation for queues from queue length data
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, ...
J. V. Ross, T. Taimre, Philip K. Pollett
TSP
2008
129views more  TSP 2008»
15 years 2 months ago
A Basic Convergence Result for Particle Filtering
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...
Xiao-Li Hu, Thomas B. Schön, Lennart Ljung
SIAMAM
2010
79views more  SIAMAM 2010»
15 years 2 months ago
On the Determination of the Boundary Impedance from the Far Field Pattern
We consider the Helmholtz equation in the half space and suggest two methods for determining the boundary impedance from knowledge of the far field pattern of the time-harmonic in...
Yuri A. Godin, Boris Vainberg