215 search results - page 13 / 43 » On the Linear Number of Matching Substrings |
DGCI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a novel template matching framework for detecting geometrically transformed objects. A template is a simplified representation of the object of interest by a s...
DC
2011
12 years 7 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
TIT
2002
13 years 7 months ago
2002
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
IEEEIAS
2009
IEEE
14 years 2 months ago
2009
IEEE
: This paper proposes a new watermarking method for detecting image tampering. First, an authentication number is created using a pair of watermark pixels as the coefficients of a ...
NIPS
2008
13 years 9 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...