1702 search results - page 177 / 341 » Doomed program points |
164
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
131
click to vote
TACS
2001
Springer
15 years 10 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
164
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
134
click to vote
OOPSLA
1992
Springer
15 years 10 months ago
1992
Springer
JAC is a Java extension for high-level concurrent programming, meant to hide the notions of threads and synchronization statements from the programmer. Putting into practice the c...
171
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...