Sciweavers

25 search results - page 1 / 5
» A new efficient retiming algorithm derived by formal manipul...
Sort
View
TODAES
2008
160views more  TODAES 2008»
13 years 5 months ago
A new efficient retiming algorithm derived by formal manipulation
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...
Hai Zhou
FM
1997
Springer
159views Formal Methods» more  FM 1997»
13 years 9 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
ICCV
2003
IEEE
14 years 7 months ago
Gaze Manipulation for One-to-one Teleconferencing
A new algorithm is proposed for novel view generation in one-toone teleconferencing applications. Given the video streams acquired by two cameras placed on either side of a comput...
Antonio Criminisi, Jamie Shotton, Andrew Blake, Ph...
COLING
1996
13 years 6 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
DAC
1998
ACM
14 years 6 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...