2168 search results - page 128 / 434 » Randomized Algorithms and Complexity Theory |
125
click to vote
PICS
2000
15 years 4 months ago
2000
A method of data embedding based on the convolution of message data with a random phase carrier is presented. The theory behind this method is reviewed and it is shown that the te...
76
Voted
RSA
1998
15 years 3 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
114
click to vote
COR
2008
15 years 3 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
124
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
144
Voted
CHES
2005
Springer
15 years 8 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...