45 search results - page 6 / 9 » The Shortest Path to the Future Web |
CIKM
2003
Springer
13 years 11 months ago
2003
Springer
There have been several techniques proposed for building statistics for static XML data. However, very little work has been done in the area of building XML statistics for data so...
WSDM
2009
ACM
14 years 29 days ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
INFOCOM
2003
IEEE
13 years 11 months ago
2003
IEEE
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
SDM
2008
SIAM
13 years 7 months ago
2008
SIAM
Recently, modern tracking methods started to allow capturing the position of massive numbers of moving objects. Given this information, it is possible to analyze and predict the t...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...