1272 search results - page 121 / 255 » Approximate Parameterized Matching |
173
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
189
click to vote
NDSS
2007
IEEE
16 years 1 months ago
2007
IEEE
The need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have ...
198
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
The sound reaching the acoustic sensor in a realistic environment contains not only the part arriving directly from the sound source but also a number of environmental re ections....
187
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
172
click to vote
SIROCCO
2010
15 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...