6300 search results - page 1004 / 1260 » We have it easy, but do we have it right |
107
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
115
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
In this paper we consider a common form of the English auction that is widely used in online Internet auctions. This discrete bid auction requires that the bidders may only submit...
154
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
CRYPTO
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we introduce the method of bi-linear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased character...
114
click to vote
ASIACRYPT
2000
Springer
15 years 6 months ago
2000
Springer
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...