Sciweavers

877 search results - page 83 / 176
» Structural Cut Elimination
Sort
View
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
13 years 11 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
ET
2006
154views more  ET 2006»
13 years 7 months ago
An Automated BIST Architecture for Testing and Diagnosing FPGA Interconnect Faults
We present an efficient built-in self-test (BIST) architecture for testing and diagnosing stuck-at faults, delay faults, and bridging faults in FPGA interconnect resources. The BIS...
Jack Smith, Tian Xia, Charles E. Stroud
CVPR
2012
IEEE
11 years 10 months ago
General trajectory prior for Non-Rigid reconstruction
Trajectory basis Non-Rigid Structure From Motion (NRSFM) currently faces two problems: the limit of reconstructability and the need to tune the basis size for different sequences....
Jack Valmadre, Simon Lucey
CIE
2010
Springer
14 years 16 days ago
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
Samuel Mimram
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann