Sciweavers

180 search results - page 7 / 36
» Measure on P: Robustness of the Notion
Sort
View
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 8 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar
NOSSDAV
2009
Springer
14 years 2 months ago
Adaptive overlay topology for mesh-based P2P-TV systems
In this paper, we propose a simple and fully distributed mechanism for constructing and maintaining the overlay topology in mesh-based P2P-TV systems. Our algorithm optimizes the ...
Richard John Lobb, Ana Paula Couto da Silva, Emili...
ATAL
2008
Springer
13 years 9 months ago
Tags and image scoring for robust cooperation
Establishing and maintaining cooperation is an enduring problem in multi-agent systems and, although several solutions exist, the increased use of online trading systems, peerto-p...
Nathan Griffiths
IANDC
2008
74views more  IANDC 2008»
13 years 7 months ago
Baire categories on small complexity classes and meager-comeager laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
Philippe Moser
CIKM
2006
Springer
13 years 11 months ago
Ranking robustness: a novel framework to predict query performance
In this paper, we introduce the notion of ranking robustness, which refers to a property of a ranked list of documents that indicates how stable the ranking is in the presence of ...
Yun Zhou, W. Bruce Croft