Sciweavers

4526 search results - page 58 / 906
» Algorithmic problems related to the Internet
Sort
View
SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
14 years 2 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...
LAWEB
2003
IEEE
14 years 2 months ago
The Best Trail Algorithm for Assisted Navigation of Web Sites
We present an algorithm called the Best Trail Algorithm, which helps solve the hypertext navigation problem by automating the construction of memex-like trails through the corpus....
Richard Wheeldon, Mark Levene
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 6 months ago
List Factoring and Relative Worst Order Analysis
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algori...
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
CEAS
2005
Springer
14 years 2 months ago
Email Task Management: An Iterative Relational Learning Approach
Today’s email clients were designed for yesterday’s email. Originally, email was merely a communication medium. Today, people engage in a variety of complex behaviours using e...
Rinat Khoussainov, Nicholas Kushmerick
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 8 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...