340 search results - page 16 / 68 » Clustering with Lower Bound on Similarity |
ECIR
2003
Springer
14 years 10 months ago
2003
Springer
Abstract. To measure the similarity of words, sentences, and documents is one of the major issues in multi-lingual multi-document summarization. This paper presents five strategies...
MFCS
1997
Springer
15 years 1 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
ICC
1997
IEEE
15 years 1 months ago
1997
IEEE
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
75
Voted
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...