738 search results - page 58 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
DSSCV
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Blurring an image with a Gaussian of width σ and considering σ as an extra dimension, extends the image to an Gaussian scale space (GSS) image. In this GSS-image the is...
113
click to vote
JVCA
2010
14 years 8 months ago
2010
We present a new algorithm to generate plausible motions for high-DOF human-like articulated figures in constrained environments with multiple obstacles. Our approach is general ...
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Tabulating elliptic curves has been carried out since the earliest days of machine computation in number theory. After some historical remarks, we report on significant r...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
101
click to vote
RTCSA
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents the concepts of switching in the Time-Triggered Network-on-Chip (TTNoC), which is the communication subsystem of the Time-Triggered Systemon-Chip (TTSoC) archi...