5606 search results - page 648 / 1122 » Randomization Techniques for Graphs. |
193
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
233
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
172
click to vote
ACSD
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
169
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
166
click to vote
CRYPTO
2010
Springer
15 years 8 months ago
2010
Springer
We present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, we construct...