Results 1  10
of
3,143,544
Locally weighted learning
 ARTIFICIAL INTELLIGENCE REVIEW
, 1997
"... This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, ass ..."
Abstract

Cited by 594 (53 self)
 Add to MetaCart
This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias
1 Cramer Rao Bound on Target Localization Estimation in MIMO Radar Systems
"... Abstract — This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (MultipleInput MultipleOutput) radar systems, configured with multiple transmit and receive antennas, widely distributed over a given area. The CramerRao lower bound (CRLB) for target localiz ..."
Abstract
 Add to MetaCart
localization is developed for coherent processing. It is shown that the localization estimation accuracy can be approximated as inversely proportional to the carrier frequency in the coherent case. Evaluation of the relation between sensors locations, target location, and localization accuracy is provided by a
Ziv Zakai Lower Bound on Target Localization Estimation in MIMO Radar Systems
"... Abstract—This paper presents the derivation of the ZivZakai bound (ZZB) for the localization problem in a MIMO radar system. The target is positioned in the nearfield of a network of radars of arbitrary geometry. The radars have ideal mutual time and phase synchronization. The target location is e ..."
Abstract
 Add to MetaCart
the localization error is limited only by the a priori information about the location of the target. In the ambiguity region, the performance of the location estimator is affected by sidelobes. In the ambiguity free region, estimation errors are very small and the ZZB approaches the CramerRao lower bound (CRLB
Robust Monte Carlo Localization for Mobile Robots
, 2001
"... Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilistic localization algorithms known as Monte Carlo Localization (MCL). MCL algorithms represent a robot's belief by a set of weighted hypotheses (samples), whi ..."
Abstract

Cited by 826 (88 self)
 Add to MetaCart
), which approximate the posterior under a common Bayesian formulation of the localization problem. Building on the basic MCL algorithm, this article develops a more robust algorithm called MixtureMCL, which integrates two complimentary ways of generating samples in the estimation. To apply this algorithm
Inflation Forecast Targeting: Implementing and Monitoring Inflation Targets
, 1996
"... Inflation targeting is shown to imply inflation forecast targeting: the central bank's inflation forecast becomes an explicit intermediate target. Inflation forecast targeting simplifies both implementation and monitoring of monetary policy. The weight on output stabilization determines how qui ..."
Abstract

Cited by 668 (48 self)
 Add to MetaCart
Inflation targeting is shown to imply inflation forecast targeting: the central bank's inflation forecast becomes an explicit intermediate target. Inflation forecast targeting simplifies both implementation and monitoring of monetary policy. The weight on output stabilization determines how
An Algorithm for Tracking Multiple Targets
 IEEE Transactions on Automatic Control
, 1979
"... Abstract—An algorithm for tracking multiple targets In a cluttered algorithms. Clustering is the process of dividing the entire environment Is developed. The algorithm Is capable of Initiating tracks, set of targets and measurements into independent groups accounting for false or m[~clngreports, and ..."
Abstract

Cited by 586 (0 self)
 Add to MetaCart
target, or that the measurement Is false. nally, it is desirable for an algorithm to be recursive so Target states are estimated from each such da*aas.soclatloo hypothesis that all the previous data do not have to be reprocessed using a 1C~InlQnfilter. As mere measurements are received, the probabill
Endpoint Strichartz estimates
 Amer. J. Math
, 1998
"... Abstract. We prove an abstract Strichartz estimate, which implies previously unknown endpoint Strichartz estimates for the wave equation (in dimension n 4) and the Schrödinger equation (in dimension n 3). Three other applications are discussed: local existence for a nonlinear wave equation; and Stri ..."
Abstract

Cited by 525 (42 self)
 Add to MetaCart
Abstract. We prove an abstract Strichartz estimate, which implies previously unknown endpoint Strichartz estimates for the wave equation (in dimension n 4) and the Schrödinger equation (in dimension n 3). Three other applications are discussed: local existence for a nonlinear wave equation
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 766 (29 self)
 Add to MetaCart
Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We
Hierarchical modelbased motion estimation
, 1992
"... This paper describes a hierarchical estimation framework for the computation of diverse representations of motion information. The key features of the resulting framework (or family of algorithms) a,re a global model that constrains the overall structure of the motion estimated, a local rnodel that ..."
Abstract

Cited by 667 (15 self)
 Add to MetaCart
This paper describes a hierarchical estimation framework for the computation of diverse representations of motion information. The key features of the resulting framework (or family of algorithms) a,re a global model that constrains the overall structure of the motion estimated, a local rnodel
PCASIFT: A more distinctive representation for local image descriptors
, 2004
"... Stable local feature detection and representation is a fundamental component of many image registration and object recognition algorithms. Mikolajczyk and Schmid [14] recently evaluated a variety of approaches and identified the SIFT [11] algorithm as being the most resistant to common image deforma ..."
Abstract

Cited by 572 (6 self)
 Add to MetaCart
Stable local feature detection and representation is a fundamental component of many image registration and object recognition algorithms. Mikolajczyk and Schmid [14] recently evaluated a variety of approaches and identified the SIFT [11] algorithm as being the most resistant to common image
Results 1  10
of
3,143,544