Results 1 - 10 of 18,680

Efficient implementation of a BDD package

by Karl S. Brace, Richard L. Rudell, Randal E. Bryant - In Proceedings of the 27th ACM/IEEE conference on Design autamation , 1991
"... Efficient manipulation of Boolean functions is an important component of many computer-aided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract - Cited by 504 (9 self) - Add to MetaCart
to decrease memory use. Memory function efficiency is improved by using rules that detect. when equivalent functions are computed. The usefulness of the package is enhanced by an automatic and low-cost scheme for rec:ycling memory. Experimental results are given to demonstrate why various implementation trade

Symbolic Boolean manipulation with ordered binary-decision diagrams

by Randal E Bryant - ACM COMPUTING SURVEYS , 1992
"... Ordered Binary-Decision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract - Cited by 1036 (13 self) - Add to MetaCart
Ordered Binary-Decision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented

Notions of Computation and Monads

by Eugenio Moggi , 1991
"... The i.-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be identified with I-terms. However, if one goes further and uses bn-conversion to prove equivalence of programs, then a gross simplification is introduced (programs are identified with ..."
Abstract - Cited by 867 (15 self) - Add to MetaCart
with total functions from calues to values) that may jeopardise the applicability of theoretical results, In this paper we introduce calculi. based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation.

Plenoptic Modeling: An Image-Based Rendering System

by Leonard McMillan, Gary Bishop , 1995
"... Image-based rendering is a powerful new approach for generating real-time photorealistic computer graphics. It can provide convincing animations without an explicit geometric representation. We use the “plenoptic function” of Adelson and Bergen to provide a concise problem statement for image-based ..."
Abstract - Cited by 760 (20 self) - Add to MetaCart
Image-based rendering is a powerful new approach for generating real-time photorealistic computer graphics. It can provide convincing animations without an explicit geometric representation. We use the “plenoptic function” of Adelson and Bergen to provide a concise problem statement for image

The Coordination of Arm Movements: An Experimentally Confirmed Mathematical Model

by Tamar Flash, Neville Hogans - Journal of neuroscience , 1985
"... This paper presents studies of the coordination of volun-tary human arm movements. A mathematical model is for-mulated which is shown to predict both the qualitative fea-tures and the quantitative details observed experimentally in planar, multijoint arm movements. Coordination is modeled mathematic ..."
Abstract - Cited by 688 (18 self) - Add to MetaCart
mathematically by defining an objective function, a measure of performance for any possi-ble movement. The unique trajectory which yields the best performance is determined using dynamic optimization the-ory. In the work presented here, the objective function is the square of the magnitude of jerk (rate

Algebraic laws for nondeterminism and concurrency

by Matthew Hennessy, Robin Milner - Journal of the ACM , 1985
"... Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. Firs ..."
Abstract - Cited by 608 (13 self) - Add to MetaCart
Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth

Points-to Analysis in Almost Linear Time

by Bjarne Steensgaard , 1996
"... We present an interprocedural flow-insensitive points-to analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described. The algorithm is based on a non-s ..."
Abstract - Cited by 595 (3 self) - Add to MetaCart
for these functions. The results are equivalent to those of a flow-insensitive alias analysis (and control flow analysis) that assumes alias relations are reflexive and transitive. This work makes

Mean shift: A robust approach toward feature space analysis

by Dorin Comaniciu, Peter Meer - In PAMI , 2002
"... A general nonparametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure, the mean shift. We prove for discrete data the convergence ..."
Abstract - Cited by 2395 (37 self) - Add to MetaCart
the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and thus its utility in detecting the modes of the density. The equivalence of the mean shift procedure to the Nadaraya–Watson estimator from kernel regression and the robust M

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given

Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images.

by Stuart Geman , Donald Geman - IEEE Trans. Pattern Anal. Mach. Intell. , 1984
"... Abstract-We make an analogy between images and statistical mechanics systems. Pixel gray levels and the presence and orientation of edges are viewed as states of atoms or molecules in a lattice-like physical system. The assignment of an energy function in the physical system determines its Gibbs di ..."
Abstract - Cited by 5126 (1 self) - Add to MetaCart
distribution. Because of the Gibbs distribution, Markov random field (MRF) equivalence, this assignment also determines an MRF image model. The energy function is a more convenient and natural mechanism for embodying picture attributes than are the local characteristics of the MRF. For a range of degradation
Results 1 - 10 of 18,680