13603 search results - page 211 / 2721 » On the Computational Complexity of Cut-Reduction |
164
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmical...
169
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
153
click to vote
COMGEO
2010
ACM
15 years 5 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
164
click to vote
ICGI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
175
click to vote
APWEB
2010
Springer
15 years 7 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...