• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 291,768
Next 10 →

Reversible Logic Synthesis of k-Input, m-Output Lookup Tables

by Alireza Shafaei, Mehdi Saeedi, Massoud Pedram
"... Abstract—Improving circuit realization of known quantum algorithms by CAD techniques has benefits for quantum experimentalists. In this paper, we address the problem of synthesizing a given k-input, m-output lookup table (LUT) by a reversible circuit. This problem has interesting applications in the ..."
Abstract - Add to MetaCart
Abstract—Improving circuit realization of known quantum algorithms by CAD techniques has benefits for quantum experimentalists. In this paper, we address the problem of synthesizing a given k-input, m-output lookup table (LUT) by a reversible circuit. This problem has interesting applications

Temporal and modal logic

by E. Allen Emerson - HANDBOOK OF THEORETICAL COMPUTER SCIENCE , 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract - Cited by 1300 (17 self) - Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.

Alternating-time Temporal Logic

by Rajeev Alur, Thomas Henzinger, Orna Kupferman - Journal of the ACM , 1997
"... Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract - Cited by 615 (55 self) - Add to MetaCart
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general

SIS: A System for Sequential Circuit Synthesis

by Ellen M. Sentovich, Kanwar Jit Singh, Luciano Lavagno, Cho Moon, Rajeev Murgai, Alexander Saldanha, Hamid Savoj, Paul R. Stephan, Robert K. Brayton, Alberto Sangiovanni-Vincentelli , 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input-output b ..."
Abstract - Cited by 514 (41 self) - Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logic-level description of a sequential circuit, it produces an optimized net-list in the target technology while preserving the sequential input-output

Inductive Logic Programming: Theory and Methods

by Stephen Muggleton, Luc De Raedt - JOURNAL OF LOGIC PROGRAMMING , 1994
"... ..."
Abstract - Cited by 530 (46 self) - Add to MetaCart
Abstract not found

View Interpolation for Image Synthesis

by Shenchang Eric Chen, et al.
"... Image-space simplifications have been used to accelerate the calculation of computer graphic images since the dawn of visual simulation. Texture mapping has been used to provide a means by which images may themselves be used as display primitives. The work reported by this paper endeavors to carry t ..."
Abstract - Cited by 605 (0 self) - Add to MetaCart
this concept to its logical extreme by using interpolated images to portray three-dimensional scenes. The special-effects technique of morphing, which combines interpolation of texture maps and their shape, is applied to computing arbitrary intermediate frames from an array of prestored images. If the images

Reversible Markov chains and random walks on graphs

by David Aldous, James Allen Fill , 2002
"... ..."
Abstract - Cited by 549 (13 self) - Add to MetaCart
Abstract not found

Parametric Shape Analysis via 3-Valued Logic

by Mooly Sagiv, Thomas Reps, Reinhard Wilhelm , 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract - Cited by 660 (79 self) - Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...

The Great Reversals: The Politics of Financial Development in the 20th Century

by Raghuram G. Rajan, Luigi Zingales, Roger Laeven, Galina Ovtcharova, Nahid Rahman, Sofia Ramos, Ruy Ribeiro, Amir Sasson , 2001
"... Indicators of the development of the financial sector do not improve monotonically over time. In particular, we find that by most measures, countries were more financially developed in 1913 than in 1980 and only recently have they surpassed their 1913 levels. This pattern cannot be explained by stru ..."
Abstract - Cited by 527 (13 self) - Add to MetaCart
Indicators of the development of the financial sector do not improve monotonically over time. In particular, we find that by most measures, countries were more financially developed in 1913 than in 1980 and only recently have they surpassed their 1913 levels. This pattern cannot be explained by structural theories that attribute cross-country differences in financial development to time-invariant factors, such as a country's legal origin or culture. We propose an "interest group" theory of financial development where incumbents oppose financial development because it breeds competition. The theory predicts that incumbents' opposition will be weaker when an economy allows both cross-border trade and capital flows. This theory can go some way in accounting for the cross-country differences and the time series variation of financial development. When we recognize that different kinds of institutional heritages afford different scope for private interests to express themselves, we obtain a...

Graph-based algorithms for Boolean function manipulation

by Randal E. Bryant - IEEE TRANSACTIONS ON COMPUTERS , 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract - Cited by 3499 (47 self) - Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Next 10 →
Results 1 - 10 of 291,768
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University