4117 search results - page 553 / 824 » On the Satisfiability of Complex Constraints |
169
click to vote
IDEAS
1998
IEEE
15 years 11 months ago
1998
IEEE
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. ter...
180
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
180
click to vote
HUMO
2000
Springer
15 years 10 months ago
2000
Springer
This paper presents a method of hand posture estimation from silhouette images taken by two cameras. First, we extract the silhouette contour for a pair of images. We construct an...
210
click to vote
ACMACE
2008
ACM
15 years 8 months ago
2008
ACM
BeatBender is a computer music project that explores a new method for generating emergent rhythmic drum patterns using the subsumption architecture. Rather than explicitly coding ...
187
click to vote
DGCI
2006
Springer
15 years 8 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...