Sciweavers

2607 search results - page 2 / 522
» Complete Functional Synthesis
Sort
View
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 5 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
CGI
2006
IEEE
14 years 5 months ago
Appearance and Geometry Completion with Constrained Texture Synthesis
A novel approach for appearance and geometry completion over point-sampled geometry is presented in this paper. Based on the result of surface clustering and the given texture samp...
Chunxia Xiao, Wenting Zheng, Yongwei Miao, Yong Zh...
CVPR
2004
IEEE
15 years 26 days ago
Space-Time Video Completion
We present a method for space-time completion of large space-time "holes" in video sequences of complex dynamic scenes. The missing portions are filled-in by sampling sp...
Yonatan Wexler, Eli Shechtman, Michal Irani
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
14 years 5 months ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...
ATS
2003
IEEE
151views Hardware» more  ATS 2003»
14 years 4 months ago
BDD Based Synthesis of Symmetric Functions with Full Path-Delay Fault Testability
A new technique for synthesizing totally symmetric Boolean functions is presented that achieves complete robust path delay fault testability. We apply BDDs for the synthesis of sy...
Junhao Shi, Görschwin Fey, Rolf Drechsler