Sciweavers

674 search results - page 48 / 135
» Subwebs for specialized search
Sort
View
CORR
2011
Springer
115views Education» more  CORR 2011»
12 years 11 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
12 years 11 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
NAR
2011
235views Computer Vision» more  NAR 2011»
12 years 10 months ago
P2CS: a database of prokaryotic two-component systems
P2CS (http://www.p2cs.org) is a specialized database for prokaryotic two-component systems (TCSs), virtually ubiquitous signalling proteins which regulate a wide range of physiolo...
Mohamed Barakat, Philippe Ortet, David E. Whitwort...
ICIP
2007
IEEE
14 years 9 months ago
An Efficient Method for Compressed Sensing
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex prob...
Seung-Jean Kim, Kwangmoo Koh, Michael Lustig, Step...
AICCSA
2007
IEEE
84views Hardware» more  AICCSA 2007»
14 years 2 months ago
Encoding Algorithms for Logic Synthesis
This paper presents an encoding algorithm that is very efficient for many different logic synthesis problems. The algorithm is based on the use of special tables and includes two ...
Valery Sklyarov, Iouliia Skliarova