Sciweavers

68 search results - page 11 / 14
» From boolean to quantitative synthesis
Sort
View
72
Voted
ICCV
2003
IEEE
15 years 11 months ago
Facial Expression Decomposition
In this paper, we propose a novel approach for facial expression decomposition - Higher-Order Singular Value Decomposition (HOSVD), a natural generalization of matrix SVD. We lear...
Hongcheng Wang, Narendra Ahuja
ASPLOS
2006
ACM
15 years 3 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...
SARA
2009
Springer
15 years 4 months ago
Automated Redesign with the General Redesign Engine
: Given a system design (SD), a key task is to optimize this design to reduce the probability of catastrophic failures. We consider the task of redesigning an SD to minimize the pr...
Alexander Feldman, Gregory M. Provan, Johan de Kle...
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
15 years 6 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee
ISCAS
2006
IEEE
106views Hardware» more  ISCAS 2006»
15 years 3 months ago
Integrating observability don't cares in all-solution SAT solvers
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
Sean Safarpour, Andreas G. Veneris, Rolf Drechsler