10718 search results - page 518 / 2144 » On the Circuit Implementation Problem |
212
click to vote
MVA
1996
15 years 8 months ago
1996
Segmentation of range images using superquadric entities has been pointed out by a number of researchers as a powerful approach towards object recognition. Problems exist in findi...
160
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
233
click to vote
ENTCS
2007
15 years 7 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
200
click to vote
FTEDA
2007
15 years 7 months ago
2007
The number of gates on a chip is quickly growing toward and beyond the one billion mark. Keeping all the gates running at the beat of a single or a few rationally related clocks i...
174
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...