Results 1  10
of
85,952
Accurate Singular Values of Bidiagonal Matrices
 SIAM J. SCI. STAT. COMPUT
, 1990
"... Computing the singular values of a bidiagonal matrix is the fin al phase of the standard algow rithm for the singular value decomposition of a general matrix. We present a new algorithm hich computes all the singular values of a bidiagonal matrix to high relative accuracy independent of their magni ..."
Abstract

Cited by 127 (18 self)
 Add to MetaCart
Computing the singular values of a bidiagonal matrix is the fin al phase of the standard algow rithm for the singular value decomposition of a general matrix. We present a new algorithm hich computes all the singular values of a bidiagonal matrix to high relative accuracy independent
A rapid hierarchical radiosity algorithm
 Computer Graphics
, 1991
"... This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing lar e polygonal patches. The afgorithm constructs a hierarchic“J representation of the form factor matrix by adaptively subdividing patches into su bpatches according to a usersupplied error bound. The a ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
. The algorithm guarantees that all form factors are calculated to the same precision, removing many common image artifacts due to inaccurate form factors. More importantly, the al orithm decomposes the form factor matrix into at most O? n) blocks (where n is the number of elements). Previous radiosity
Aligning Sentences in Parallel Corpora
 In Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics (ACL'91
, 1991
"... In this paper we describe a statistical technique for aligning sentences with their translations in two parallel corpora. In addition to certain anchor points that are available in our da.ta, the only information about the sentences that we use for calculating alignments i the number of tokens that ..."
Abstract

Cited by 219 (3 self)
 Add to MetaCart
In this paper we describe a statistical technique for aligning sentences with their translations in two parallel corpora. In addition to certain anchor points that are available in our da.ta, the only information about the sentences that we use for calculating alignments i the number of tokens that they contain. Because we make no use of the lexical details of the sentence, the alignment computation is fast and therefore practical for application to very large collections of text. We have used this technique to align several million sentences in the EnglishFrench Hans~trd corpora nd have achieved an accuracy in excess of 99 % in a random selected set of 1000 sentence pairs that we checked by hand. We show that even without he benefit of anchor points the correlation between the lengths of aligned sentences i strong enough that we should expect o achieve an accuracy of between 96 % and 97%. Thus, the technique may be applicable to a wider variety of texts than we have yet tried.
FastHenry: A MultipoleAccelerated 3D Inductance Extraction Program
, 1993
"... ... based on mesh analysis can be combined with a GMRESstyle iterative matrix solution technique to make a reasonably fast 3D frequency dependent inductance and resistance extraction algorithm. Unfortunately, both the computation time and memory re quired for that approach grow faster than n 2, w ..."
Abstract

Cited by 214 (48 self)
 Add to MetaCart
... based on mesh analysis can be combined with a GMRESstyle iterative matrix solution technique to make a reasonably fast 3D frequency dependent inductance and resistance extraction algorithm. Unfortunately, both the computation time and memory re quired for that approach grow faster than n 2, where n is the number of volumefilaments. In this paper, we show that it is possible to use multipoleacceleration to reduce both required memory and computation time to nearly order n. Results from examples are given to demonstrate that the multipole acceleration can reduce required computation time and memory by more than an order of magnitude for realistic packaging problems.
Semantic cognition: A parallel distributed processing approach
 Connectionist perspectives on categoryspecific deficits. In: Categoryspecificity in brain and
, 2004
"... Copyright c ..."
Measuring the Effects of Monetary Policy: A FactorAugmented Vector Autoregressive (FAVAR) Approach,” NBER Working Paper No
"... Structural vector autoregressions (VARs) are widely used to trace out the effect of monetary policy innovations on the economy. However, the sparse information sets typically used in these empirical models lead to at least three potential problems with the results. First, to the extent that centra ..."
Abstract

Cited by 184 (0 self)
 Add to MetaCart
, impulse responses can be observed only for the included variables, which generally constitute only a small subset of the variables that the researcher and policymaker care about. In this paper we investigate one potential solution to this limited information problem, which combines the standard
The Dependence Identification Neural Network Construction Algo rithm
 of the ISIS Group at the University of Notre Dame, Notre
, 1993
"... An algorithm for constructing and training multilayer neural networks, dependence identification, is presented in this paper. Its distinctive features are that (i) it transforms the training problem into a set of quadratic optimization problems that are solved by a number of linear equations and (ii ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
. In addition to constructing an appropriate network based on training data, the dependence identification algorithm significantly speeds up learning in feedforward multilayer neural networks compared to standard backpropagation. 1
What do we Learn About Consumer Demand Patterns from Micro Data
 American Economic Review
, 1993
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JS ..."
Abstract

Cited by 178 (19 self)
 Add to MetaCart
JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org. American Economic Association is collaborating with JSTOR to digitize, preserve and extend access to The
rithms, Estimation of Distribution Algorithm are suitable meth
"... Abstract—Stochastic optimisers such as Evolutionary Algo ..."
Results 1  10
of
85,952