Sciweavers

395 search results - page 59 / 79
» Encoding Algorithms for Logic Synthesis
Sort
View
IANDC
2011
127views more  IANDC 2011»
14 years 9 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
98
Voted
VTS
2003
IEEE
95views Hardware» more  VTS 2003»
15 years 7 months ago
Built-In Reseeding for Serial Bist
Reseeding is used to improve fault coverage in pseudo-random testing. Most of the work done on reseeding is based on storing the seeds in an external tester. Besides its high cost...
Ahmad A. Al-Yamani, Edward J. McCluskey
CSL
2002
Springer
15 years 2 months ago
Learning visually grounded words and syntax for a scene description task
A spoken language generation system has been developed that learns to describe objects in computer-generated visual scenes. The system is trained by a `show-and-tell' procedu...
Deb K. Roy
ICIP
2009
IEEE
15 years 1 days ago
Synthesis-in-the-loop for video texture coding
In this paper, we present an algorithm using dynamic texture synthesis for closed-loop video coding. Video textures, or so-called dynamic textures are video sequences with moving ...
Aleksandar Stojanovic, Mathias Wien, Thiow Keng Ta...
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
15 years 8 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri