Sciweavers

509 search results - page 34 / 102
» A formal representation of functional size measurement metho...
Sort
View
FSTTCS
2007
Springer
14 years 2 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
ASPDAC
2009
ACM
152views Hardware» more  ASPDAC 2009»
14 years 3 months ago
A novel Toffoli network synthesis algorithm for reversible logic
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
Yexin Zheng, Chao Huang
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 2 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
KDD
2004
ACM
163views Data Mining» more  KDD 2004»
14 years 9 months ago
Exploiting dictionaries in named entity extraction: combining semi-Markov extraction processes and data integration methods
We consider the problem of improving named entity recognition (NER) systems by using external dictionaries--more specifically, the problem of extending state-of-the-art NER system...
William W. Cohen, Sunita Sarawagi
DAC
1995
ACM
14 years 8 days ago
Automatic Clock Abstraction from Sequential Circuits
Our goal is to transform a low-level circuit design into a more representation. A pre-existing tool, Tranalyze [4], takes a switch-level circuit and generates a functionally equiv...
Samir Jain, Randal E. Bryant, Alok Jain