1381 search results - page 146 / 277 » Computational Complexity of Constraint Satisfaction |
119
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
Logic synthesis systems are complex systems and algorithmic research in synthesis has become highly specialized. This creates a gap where it is often not clear how an advance in a...
117
Voted
RT
1995
Springer
15 years 7 months ago
1995
Springer
: Wavelets are a powerful tool forplanar image processing. The resulting algorithms are straightforward, fast, and efficient. With the recently developed spherical wavelets this f...
155
click to vote
AMDO
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...
137
click to vote
TCS
2008
15 years 4 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
155
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...