5084 search results - page 116 / 1017 » Proving Possibility Properties |
139
click to vote
APLAS
2007
ACM
15 years 9 months ago
2007
ACM
Abstract. We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not po...
139
click to vote
JGT
2006
15 years 5 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
145
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
173
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
Statistical background modelling and subtraction has proved to be a popular and effective class of algorithms for segmenting independently moving foreground objects out from a sta...
141
click to vote
CRYPTO
2009
Springer
16 years 2 days ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...