Sciweavers

1016 search results - page 39 / 204
» Generalized distances between rankings
Sort
View
126
Voted
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
15 years 10 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
ICMCS
2006
IEEE
145views Multimedia» more  ICMCS 2006»
15 years 6 months ago
A New Study on Distance Metrics as Similarity Measurement
Distance metric is widely used in similarity estimation. In this paper we find that the most popular Euclidean and Manhattan distance may not be suitable for all data distribution...
Jie Yu, Jaume Amores, Nicu Sebe, Qi Tian
112
Voted
ECIR
1998
Springer
15 years 2 months ago
Independence of Contributing Retrieval Strategies in Data Fusion for Effective Information Retrieval
: In information retrieval, data fusion is a technique for combining the outputs of more than one retrieval strategy which rank documents for retrieval. One of the observations oft...
Alan F. Smeaton
108
Voted
IGPL
2011
14 years 7 months ago
Existentially equivalent cyclic ultrametric spaces and cyclically valued groups
The notions of ultrametric distances and cyclic valuations appear when the set of values of the distance map is a cyclically ordered set. These structures can be described as subsp...
Gérard Leloup
CCS
2008
ACM
15 years 2 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun