Sciweavers

4 search results - page 1 / 1
» Near-Entropy Hotlink Assignments
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Near-Entropy Hotlink Assignments
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
Karim Douïeb, Stefan Langerman
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
14 years 1 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
DKE
2010
102views more  DKE 2010»
13 years 7 months ago
Context-similarity based hotlinks assignment: Model, metrics and algorithm
Dimitris Antoniou, John D. Garofalakis, Christos M...
IADIS
2003
13 years 8 months ago
Optimizing Web Server's Data Transfer with Hotlinks
We study the optimization of the expected number of bytes that must be transferred by the Web server when a user visits one of its pages. Given a Web site, we want to find an assi...
Evangelos Kranakis, Danny Krizanc, Miguel Vargas M...