Sciweavers

731 search results - page 114 / 147
» Reductions to Graph Isomorphism
Sort
View
ISSS
1999
IEEE
149views Hardware» more  ISSS 1999»
14 years 1 months ago
A Buffer Merging Technique for Reducing Memory Requirements of Synchronous Dataflow Specifications
Synchronous Dataflow, a subset of dataflow, has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem duri...
Praveen K. Murthy, Shuvra S. Bhattacharyya
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
14 years 1 months ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani
DEXA
2007
Springer
114views Database» more  DEXA 2007»
14 years 24 days ago
Data Management for Mobile Ajax Web 2.0 Applications
Whenever Ajax applications on mobile devices have to retrieve large XML data fragments from a remote server, a reduction of the exchanged data volume may be crucial to manage limit...
Stefan Böttcher, Rita Steinmetz
HYBRID
2007
Springer
14 years 22 days ago
Qualitative Analysis of Nonlinear Biochemical Networks with Piecewise-Affine Functions
Abstract. Nonlinearities and the lack of accurate quantitative information considerably hamper modeling and system analysis of biochemical networks. Here we propose a procedure for...
M. W. J. M. Musters, Hidde de Jong, P. P. J. van d...
CP
2005
Springer
13 years 10 months ago
Using Boolean Constraint Propagation for Sub-clauses Deduction
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...