Results 1  10
of
23,103
The Question of Finitely Many Steps in Polynomial Ideal Theory ∗
"... In the present work, the domains in which ideals are defined are polynomial domains. An ideal will be called given if a basis of the ideal is known, and computable if a basis can be computed. This work deals with computing characteristic ideals and polynomials for a given ideal m. The computation is ..."
Abstract
 Add to MetaCart
are computations in finitely many steps. The claim that a computation can be carried out in finitely many steps will mean here that an upper bound for the number of necessary operations for the computation can be specified. Thus it is not enough, for example, to suggest a procedure, for which it can be proved
How Many Steps along the Path Is Too Far?
, 2009
"... (See the article by Neely et al, on pages 27–36.) Neely et al [1] have studied the disposition of voriconazole in children suspected or proven to have a fungal infection. Although this is important, and the pharmacokinetic data are most welcome in this difficulttostudy population, the ability to ..."
Abstract
 Add to MetaCart
(See the article by Neely et al, on pages 27–36.) Neely et al [1] have studied the disposition of voriconazole in children suspected or proven to have a fungal infection. Although this is important, and the pharmacokinetic data are most welcome in this difficulttostudy population, the ability to link the drug concentrations observed to outcome is the critical issue for this study. A number of other investigators have linked measures of voriconazole exposure to outcomes [2–5]. Most of these have linked exposure to some measure of response [2–4]. In this study, voriconazole exposure has been linked to time to death in a Cox proportional hazards model. Because the article also included a table detailing the outcomes for the patients examined and whether they had an actual trough concentration of voriconazole measured (thanks to the authors and the editors), it allowed secondary analyses to be performed. Of the patients examined, 24 had at least 1 trough concentration measured. In a logistic regression analysis, whether the measured voriconazole concentration exceeded 1.0 mg/L had a significant effect on the probability of death (odds ratio, 30.3; 95 % confidence inter
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
 IN PROCEEDINGS OF THE ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS
, 2004
"... The LemkeHowson algorithm is the classical algorithm for the problem NASH of finding one Nash equilibrium of a bimatrix game. It provides a constructive, elementary proof of existence of an equilibrium, by a typical "directed parity argument", which puts NASH into the complexity class PPA ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
PPAD. This paper presents a class of bimatrix games for which the LemkeHowson algorithm takes, even in the best case, exponential time in the dimension d of the game, requiring #((# 3=4 ) d ) many steps, where # is the Golden Ratio. The "parity argument" for NASH is thus explicitly shown
Trade Liberalization, Exit, and Productivity Improvements: Evidence from Chilean Plants
 Review of Economic Studies
, 2002
"... This paper empirically investigates the effects of liberalized trade on plant productivity in the case of Chile. Chile presents an interesting setting to study this relationship since it underwent a massive trade liberalization that significantly exposed its plants to competition from abroad during ..."
Abstract

Cited by 555 (16 self)
 Add to MetaCart
the late 1970s and early 1980s. Methodologically, I approach this question in two steps. In the first step, I estimate a production function to obtain a measure of plant productivity. I estimate the production function semiparametrically to correct for the presence of selection and simultaneity biases
The Laplacian Pyramid as a Compact Image Code
, 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixeltopixel correlations a ..."
Abstract

Cited by 1388 (12 self)
 Add to MetaCart
is achieved by quantizing the difference image. These steps are then repeated to compress the lowpass image. Iteration of the process at appropriately expanded scales generates a pyramid data structure. The encoding process is equivalent to sampling the image with Laplacian operators of many scales. Thus
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 543 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
Generic Schema Matching with Cupid
 In The VLDB Journal
, 2001
"... Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past s ..."
Abstract

Cited by 604 (17 self)
 Add to MetaCart
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past
Toolglass and magic lenses: The seethrough interface
, 1993
"... Toolglass ™ widgets are new user interface tools that can appear, as though on a transparent sheet of glass, between an application and a traditional cursor. They can be positioned with one hand while the other positions the cursor. The widgets provide a rich and concise vocabulary for operating on ..."
Abstract

Cited by 506 (8 self)
 Add to MetaCart
many advantages over traditional controls. They provide a new style of interaction that better exploits the user’s everyday skills. They can reduce steps, cursor motion, and errors. Many widgets can be provided in a user interface, by designers and by users, without requiring dedicated screen space
Automatically characterizing large scale program behavior
, 2002
"... Understanding program behavior is at the foundation of computer architecture and program optimization. Many programs have wildly different behavior on even the very largest of scales (over the complete execution of the program). This realization has ramifications for many architectural and compile ..."
Abstract

Cited by 778 (41 self)
 Add to MetaCart
Understanding program behavior is at the foundation of computer architecture and program optimization. Many programs have wildly different behavior on even the very largest of scales (over the complete execution of the program). This realization has ramifications for many architectural and com
Stable Fluids
, 1999
"... Building animation tools for fluidlike motions is an important and challenging problem with many applications in computer graphics. The use of physicsbased models for fluid flow can greatly assist in creating such tools. Physical models, unlike key frame or procedural based techniques, permit an a ..."
Abstract

Cited by 568 (9 self)
 Add to MetaCart
allows us to take larger time steps and therefore achieve faster simulations. We have used our model in conjuction with advecting solid textures to create many fluidlike animations interactively in two and threedimensions.
Results 1  10
of
23,103