Sciweavers

4934 search results - page 368 / 987
» complexity 2008
Sort
View
TCAD
2008
112views more  TCAD 2008»
15 years 6 months ago
Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
Yu Hu, Victor Shih, Rupak Majumdar, Lei He
INFSOF
2007
68views more  INFSOF 2007»
15 years 6 months ago
Object-based and class-based composition of transitive mixins
In object-oriented composition, classes and class inheritance are applied to realize type relationships and reusable building blocks. Unfortunately, these two goals might be contr...
Uwe Zdun, Mark Strembeck, Gustaf Neumann
TCS
2008
15 years 6 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
TCSV
2008
152views more  TCSV 2008»
15 years 6 months ago
Animation Key-Frame Extraction and Simplification Using Deformation Analysis
Three-dimensional animating meshes have been widely used in the computer graphics and video game industries. Reducing the animating mesh complexity is a common way of overcoming th...
Tong-Yee Lee, Chao-Hung Lin, Yu-Shuen Wang, Tai-Gu...
TCSV
2008
99views more  TCSV 2008»
15 years 6 months ago
Efficient Reference Frame Selector for H.264
This paper proposes a simple yet effective mechanism to select proper reference frames for H.264 motion estimation. Unlike traditional video codecs, H.264 permits more than one ref...
Tien-Ying Kuo, Hsin-Ju Lu