Content Search Through Comparisons

We study the problem of navigating through a database of similar objects using comparisons under heterogeneous demand, a problem strongly related to small-world network design. We show that, under heterogeneous demand, the small-world network design problem is NP-hard. Given the above negative result, we propose a novel mechanism for small-world network design and provide an upper bound on its performance under heterogeneous demand. The above mechanism has a natural equivalent in the context of content search through comparisons, again under heterogeneous demand; we use this to establish both upper and lower bounds on content-search through comparisons.


Published in:
Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP)
Presented at:
38th International Colloquium on Automata, Languages and Programming (ICALP), Zurich, Switzerland, July 4-8
Year:
2011
Keywords:
Laboratories:




 Record created 2011-04-13, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)