Sciweavers

468 search results - page 74 / 94
» One-Way Functions in Complexity Theory
Sort
View
FMCAD
2009
Springer
15 years 5 months ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
ISSTA
2009
ACM
15 years 5 months ago
Specifying the worst case: orthogonal modeling of hardware errors
During testing, the execution of valid cases is only one part of the task. Checking the behavior in boundary situations and in the presence of errors is an equally important subje...
Jewgenij Botaschanjan, Benjamin Hummel
ICPR
2008
IEEE
15 years 5 months ago
Layered shape matching and registration: Stochastic sampling with hierarchical graph representation
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
Xiaobai Liu, Liang Lin, Hongwei Li, Hai Jin, Wenbi...
ICCV
2007
IEEE
15 years 5 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
WETICE
2005
IEEE
15 years 4 months ago
Challenges and Solutions for Model Driven Web Service Composition
System theory propagates the use of models which e level of abstraction to cope with complexity, evolving out of variety and connectivity. Different modeling techniques have been ...
Konrad Pfadenhauer, Burkhard Kittl, Schahram Dustd...