Sciweavers

395 search results - page 79 / 79
» Encoding Algorithms for Logic Synthesis
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 5 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
ECCC
2007
90views more  ECCC 2007»
13 years 5 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 5 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
BMCBI
2004
229views more  BMCBI 2004»
13 years 5 months ago
Automatic annotation of protein motif function with Gene Ontology terms
Background: Conserved protein sequence motifs are short stretches of amino acid sequence patterns that potentially encode the function of proteins. Several sequence pattern search...
Xinghua Lu, Chengxiang Zhai, Vanathi Gopalakrishna...
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 7 days ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...