4212 search results - page 236 / 843 » On Compressible Pairings and Their Computation |
208
click to vote
NETWORKING
2000
15 years 8 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
197
click to vote
IANDC
2007
15 years 6 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
138
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
237
click to vote
ACNS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
136
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...