147 search results - page 8 / 30 » Polynomial Fairness and Liveness |
EUROCRYPT
2010
Springer
14 years 2 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
PG
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, we propose efficient numerical techniques for Butterworth filtering and implicit fairing of large irregular triangle meshes, where the corresponding filters are ...
CPC
2006
13 years 9 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
ICDCS
2008
IEEE
14 years 4 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
CGO
2008
IEEE
14 years 4 months ago
2008
IEEE
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...