13603 search results - page 230 / 2721 » On the Computational Complexity of Cut-Reduction |
173
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
203
click to vote
CCCG
2007
15 years 8 months ago
2007
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
187
click to vote
COMMA
2006
15 years 8 months ago
2006
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
265
click to vote
IWUC
2004
15 years 8 months ago
2004
There is an inherent chasm between the real-world and the world that can be perceived by computer systems, yielding uncertainty and ambiguity in system perceived context, with cons...
137
click to vote
SIROCCO
2003
15 years 8 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...