Sciweavers

1002 search results - page 66 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
118
Voted
DAC
2006
ACM
16 years 3 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
VLSISP
2002
112views more  VLSISP 2002»
15 years 2 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
BMCBI
2004
190views more  BMCBI 2004»
15 years 2 months ago
RAG: RNA-As-Graphs web resource
Background: The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic ...
Daniela Fera, Namhee Kim, Nahum Shiffeldrim, Julie...
120
Voted
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 6 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
PPDP
2009
Springer
15 years 9 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus