Sciweavers

45 search results - page 2 / 9
» The Shortest Path to the Future Web
Sort
View
HICSS
2003
IEEE
201views Biometrics» more  HICSS 2003»
13 years 9 months ago
Design and Evaluation of Improvement method on the Web Information Navigation - A Stochastic Search Approach
With the advent of fast growing Internet and World Wide Web (WWW), more and more companies start the electronic commerce to enhance the business competitiveness. On the other hand...
Benjamin P.-C. Yen, Y.-W. Wan
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
13 years 3 months ago
Evaluating path queries over route collections
Abstract— Nowadays, vast amount of routing data, like sequences of points of interests, landmarks, etc., are available due to the proliferation of geodata services. We refer to t...
Panagiotis Bouros, Y. Vassiliou
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
14 years 1 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
ICNP
1997
IEEE
13 years 7 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
ICPP
2009
IEEE
13 years 10 months ago
Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
Karl Jiang, David Ediger, David A. Bader