588 search results - page 12 / 118 » Reducibility and Completeness in Private Computations |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper presents a novel technique to fill in missing background and moving foreground of a video captured by a static or moving camera. Different from previous efforts which a...
NETWORKING
2010
13 years 5 months ago
2010
Web caching techniques reduce user-perceived latency by serving the most popular web objects from an intermediate memory. In order to assure that reused objects are not stale, cond...
RTA
1993
Springer
13 years 11 months ago
1993
Springer
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
QUESTA
1998
13 years 7 months ago
1998
This paper presents an approximation method for numerically solving general Markov modulated fluid models which are widely used in modelling communications and computer systems. ...