14774 search results - page 235 / 2955 » Computational complexity and evolutionary computation |
170
Voted
TIT
2008
15 years 5 months ago
2008
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
183
click to vote
SP
2002
IEEE
15 years 4 months ago
2002
IEEE
When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical ...
140
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
134
Voted
CRYPTO
2008
Springer
15 years 6 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...
137
click to vote
TCAD
2008
15 years 5 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...