Sciweavers

45 search results - page 3 / 9
» The Shortest Path to the Future Web
Sort
View
WISE
2002
Springer
13 years 9 months ago
Mining Web Logs for Personalized Site Maps
Navigating through a large Web site can be a frustrating exercise. Many sites employ Site Maps to help visitors understand the overall structure of the site. However, by their ver...
Fergus Toolan, Nicholas Kushmerick
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
13 years 10 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
HIPC
2007
Springer
13 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
WWW
2003
ACM
14 years 5 months ago
An Evolutionary Approach to Web Request Prediction
This paper proposes an evolutionary algorithm that evolves a population of finite state automata to exploit user navigational path behavior to predict, in real-time, future reques...
Dario Bonino, Fulvio Corno, Giovanni Squillero
EDBTW
2006
Springer
13 years 8 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo