83 search results - page 15 / 17 » Hardness Amplification in Proof Complexity |
164
click to vote
ASIACRYPT
2009
Springer
16 years 13 days ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
169
click to vote
COMPGEOM
2009
ACM
16 years 11 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
154
click to vote
SIGCOMM
2009
ACM
16 years 11 days ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
168
click to vote
GECCO
2007
Springer
16 years 11 hour ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
153
click to vote
GECCO
2007
Springer
16 years 10 hour ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...