215 search results - page 11 / 43 » On the Linear Number of Matching Substrings |
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
90
Voted
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Block based motion compensation techniques are commonly used in video encoding to reduce the temporal redundancy of the signal. In these techniques, each block in a video frame...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
NIPS
2008
14 years 11 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
CVPR
1996
IEEE
15 years 1 months ago
1996
IEEE
The problem of determining feature correspondences across multiple views is considered. The term true multi-image" matching is introduced to describe techniques that make ful...