Results 1  10
of
2,413,728
Initial Conditions and Moment Restrictions in Dynamic Panel Data Models
 Journal of Econometrics
, 1998
"... Estimation of the dynamic error components model is considered using two alternative linear estimators that are designed to improve the properties of the standard firstdifferenced GMM estimator. Both estimators require restrictions on the initial conditions process. Asymptotic efficiency comparisons ..."
Abstract

Cited by 2288 (16 self)
 Add to MetaCart
Estimation of the dynamic error components model is considered using two alternative linear estimators that are designed to improve the properties of the standard firstdifferenced GMM estimator. Both estimators require restrictions on the initial conditions process. Asymptotic efficiency
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2109 (27 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 699 (5 self)
 Add to MetaCart
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 654 (8 self)
 Add to MetaCart
, in many practical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually approximately known. From this initial estimate, our algorithm computes observer motion with very good precision
The Impact Of Outsourcing And HighTechnology Capital On Wages: Estimates For The United States, 19791990
, 1998
"... We estimate the relative influence of trade versus technology on wages in a "large country" setting, where technological change affects product prices. Trade is measured by the foreign outsourcing of intermediate inputs, while technological change is measured by expenditures on hightechno ..."
Abstract

Cited by 485 (19 self)
 Add to MetaCart
We estimate the relative influence of trade versus technology on wages in a "large country" setting, where technological change affects product prices. Trade is measured by the foreign outsourcing of intermediate inputs, while technological change is measured by expenditures on high
A Survey of Computer VisionBased Human Motion Capture
 Computer Vision and Image Understanding
, 2001
"... A comprehensive survey of computer visionbased human motion capture literature from the past two decades is presented. The focus is on a general overview based on a taxonomy of system functionalities, broken down into four processes: initialization, tracking, pose estimation, and recognition. Each ..."
Abstract

Cited by 509 (14 self)
 Add to MetaCart
A comprehensive survey of computer visionbased human motion capture literature from the past two decades is presented. The focus is on a general overview based on a taxonomy of system functionalities, broken down into four processes: initialization, tracking, pose estimation, and recognition. Each
Detectability of Discrete Event Systems
"... In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial ev ..."
Abstract

Cited by 791 (14 self)
 Add to MetaCart
In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial
Texture Synthesis by Nonparametric Sampling
 In International Conference on Computer Vision
, 1999
"... A nonparametric method for texture synthesis is proposed. The texture synthesis process grows a new image outward from an initial seed, one pixel at a time. A Markov random field model is assumed, and the conditional distribution of a pixel given all its neighbors synthesized so far is estimated by ..."
Abstract

Cited by 996 (7 self)
 Add to MetaCart
A nonparametric method for texture synthesis is proposed. The texture synthesis process grows a new image outward from an initial seed, one pixel at a time. A Markov random field model is assumed, and the conditional distribution of a pixel given all its neighbors synthesized so far is estimated
Maximum Likelihood Linear Transformations for HMMBased Speech Recognition
 COMPUTER SPEECH AND LANGUAGE
, 1998
"... This paper examines the application of linear transformations for speaker and environmental adaptation in an HMMbased speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple bias ..."
Abstract

Cited by 545 (65 self)
 Add to MetaCart
) constrained, which requires the variance transform to have the same form as the mean transform (sometimes referred to as featurespace transforms). Reestimation formulae for all appropriate cases of transform are given. This includes a new and efficient "full" variance transform and the extension
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
, 2002
"... Matching elements of two data schemas or two data instances plays a key role in data warehousing, ebusiness, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (sch ..."
Abstract

Cited by 577 (12 self)
 Add to MetaCart
matter of fact, we evaluate the ‘accuracy ’ of the algorithm by counting the number of needed adjustments. We conducted a user study, in which our accuracy metric was used to estimate the labor savings that the users could obtain by utilizing our algorithm to obtain an initial matching. Finally, we
Results 1  10
of
2,413,728