Results 1 - 10 of 3,688

Multiresolution Analysis of Arbitrary Meshes

by Matthias Eck , Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery, Werner Stuetzle , 1995
"... In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly becoming commonplace. Such meshes are notoriously expensive to store, transmit, render, and are awkward to edit. Multire ..."
Abstract - Cited by 600 (16 self) - Add to MetaCart
in practice typically do not meet this requirement. In this paper we present a method for overcoming the subdivision connectivity restriction, meaning that completely arbitrary meshes can now be converted to multiresolution form. The method is based on the approximation of an arbitrary initial mesh M by a

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally

Complexity-effective superscalar processors

by Subbarao Palacharla, J. E. Smith, et al. - IN PROCEEDINGS OF THE 24TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE , 1997
"... The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, instruction window wakeup and selection logic, and operand bypassing are ana-lyzed. Each is modeled and Spice simulated for ..."
Abstract - Cited by 467 (5 self) - Add to MetaCart
wakeup and selection logic is proposed and discussed. This implementation puts chains of dependent instructions into queues, and issues instructions from multiple queues in parallel. Simulation shows little slowdown as compared with a completely flexible issue window when performance is measured in clock

RMM: A Methodology for Structured Hypermedia Design

by Tomás Isakowitz, Edward A. Stohr, P. Balasubramanian , 1995
"... Hypermedia application design differs from other software design in that it involves navigation as well as user-interface and information processing issues. We present the Relationship Management Data model (RMDM) and the Relationship Management (RMM) methodology for the design and development of hy ..."
Abstract - Cited by 387 (2 self) - Add to MetaCart
Hypermedia application design differs from other software design in that it involves navigation as well as user-interface and information processing issues. We present the Relationship Management Data model (RMDM) and the Relationship Management (RMM) methodology for the design and development

Using simulation methods for Bayesian econometric models: Inference, development and communication

by John Geweke - Econometric Review , 1999
"... This paper surveys the fundamental principles of subjective Bayesian inference in econometrics and the implementation of those principles using posterior simulation methods. The emphasis is on the combination of models and the development of predictive distributions. Moving beyond conditioning on a ..."
Abstract - Cited by 356 (16 self) - Add to MetaCart
fixed number of completely specified models, the paper introduces subjective Bayesian tools for formal comparison of these models with as yet incompletely specified models. The paper then shows how posterior simulators can facilitate communication between investigators (for example, econometricians

Algorithms for scheduling imprecise computations

by Jane W. S. Liu, Kwei-jay Lin, Wei-kuan Shih, Albert Chuang-shi Yu - IEEE Computer , 1991
"... n a hard real-time cyctem, every time-T critical task must meet its timing con-1 straint, typically specified as its deadline. (A task is a granule of computa-tion treated by the scheduler as a unit of work to be allocated processor time, or scheduled.) If any time-critical task fails to complete an ..."
Abstract - Cited by 256 (17 self) - Add to MetaCart
n a hard real-time cyctem, every time-T critical task must meet its timing con-1 straint, typically specified as its deadline. (A task is a granule of computa-tion treated by the scheduler as a unit of work to be allocated processor time, or scheduled.) If any time-critical task fails to complete

Subdivision surfaces in character animation

by Tony Derose, Michael Kass, Tien Truong - In Proceedings of the 25th annual conference on Computer graphics and interactive techniques, SIGGRAPH ’98 , 1998
"... The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shapes such as heads, hands, and clothing. Traditionally, these shapes have been modeled with NURBS surfaces despite the seve ..."
Abstract - Cited by 233 (1 self) - Add to MetaCart
The creation of believable and endearing characters in computer graphics presents a number of technical challenges, including the modeling, animation and rendering of complex shapes such as heads, hands, and clothing. Traditionally, these shapes have been modeled with NURBS surfaces despite

Consistency of Clark's Completion and Existence of Stable Models

by François Fages , 1994
"... The most general notion of canonical model for a logic program with negation is the one of stable model [9]. In [7] the stable models of a logic program are characterized by the well-supported Herbrand models of the program, and a new fixed point semantics that formalizes the bottom-up truth mainten ..."
Abstract - Cited by 170 (2 self) - Add to MetaCart
decreasing chain w.r.t. the positive dependencies in the atom dependency graph of \Pi) then the Herbrand models of comp(\Pi) coincide with the stable models of \Pi. From this result and the ones of [10] [17] [2] on the consistency of Clark's completion, we obtain sufficient conditions for the existence

Marginal Likelihood From the Metropolis-Hastings Output

by Siddhartha Chib, Ivan Jeliazkov - OUTPUT,JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION , 2001
"... This article provides a framework for estimating the marginal likelihood for the purpose of Bayesian model comparisons. The approach extends and completes the method presented in Chib (1995) by overcoming the problems associated with the presence of intractable full conditional densities. The propos ..."
Abstract - Cited by 217 (16 self) - Add to MetaCart
This article provides a framework for estimating the marginal likelihood for the purpose of Bayesian model comparisons. The approach extends and completes the method presented in Chib (1995) by overcoming the problems associated with the presence of intractable full conditional densities

Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-complete

by Bonnie Berger, et al. , 1998
"... One of the simplest and most popular biophysical mod-els of protein folding is the hydrophobic-hydrophilic (HP) model. The HP model abstracts the hydrophobic in-teraction in protein folding by labeling the amino acids as hydrophobic (H for nonpolar) or hydrophilic (P for polar). Chains of amino acid ..."
Abstract - Cited by 156 (0 self) - Add to MetaCart
One of the simplest and most popular biophysical mod-els of protein folding is the hydrophobic-hydrophilic (HP) model. The HP model abstracts the hydrophobic in-teraction in protein folding by labeling the amino acids as hydrophobic (H for nonpolar) or hydrophilic (P for polar). Chains of amino
Results 1 - 10 of 3,688