Sciweavers

164 search results - page 9 / 33
» Equivalent Transformation by Safe Extension of Data Structur...
Sort
View
CHARME
2005
Springer
145views Hardware» more  CHARME 2005»
13 years 9 months ago
Maximal Input Reduction of Sequential Netlists via Synergistic Reparameterization and Localization Strategies
Abstract. Automatic formal verification techniques generally require exponential resources with respect to the number of primary inputs of a netlist. In this paper, we present sev...
Jason Baumgartner, Hari Mony
JUCS
2008
165views more  JUCS 2008»
13 years 7 months ago
Shortcut Fusion of Monadic Programs
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
Cecilia Manzino, Alberto Pardo
ISPDC
2010
IEEE
13 years 6 months ago
Operational Semantics of the Marte Repetitive Structure Modeling Concepts for Data-Parallel Applications Design
—This paper presents an operational semantics of the repetitive model of computation, which is the basis for the repetitive structure modeling (RSM) package defined in the stand...
Abdoulaye Gamatié, Vlad Rusu, Éric R...
PODS
2008
ACM
152views Database» more  PODS 2008»
14 years 7 months ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
13 years 11 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines