1541 search results - page 67 / 309 » Analysis of Random Noise and Random Walk Algorithms |
CHES
2005
Springer
14 years 2 months ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
COMGEO
2004
ACM
13 years 9 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
WWW
2009
ACM
14 years 10 months ago
2009
ACM
Social media sharing web sites like Flickr allow users to annotate images with free tags, which significantly facilitate Web image search and organization. However, the tags assoc...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...