983 search results - page 77 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
ICCV
2007
IEEE
14 years 4 months ago
2007
IEEE
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...
CHES
2010
Springer
13 years 11 months ago
2010
Springer
The power of side-channel leakage attacks on cryptographic implementations is evident. Today's practical defenses are typically attack-specific countermeasures against certain...
ICESS
2004
Springer
14 years 3 months ago
2004
Springer
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
IJCNLP
2005
Springer
14 years 3 months ago
2005
Springer
Research on linear text segmentation has been an on-going focus in NLP for the last decade, and it has great potential for a wide range of applications such as document summarizati...
DAC
1994
ACM
14 years 2 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...