In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the ...
For many performance analysis problems, the ability to reason across traces is invaluable. However, due to non-determinism in the OS and virtual machines, even two identical runs ...
Recent announcement of the MSN Direct Service has demonstrated the feasibility and industrial interest in utilizing wireless broadcast for pervasive information services. To suppo...
The link structure of the Web graph is used in algorithms such as Kleinberg’s HITS and Google’s PageRank to assign authoritative weights to Web pages and thus rank them. Both ...
A reasonably good description of the luminosity profiles of galaxies is needed as it serves as a guide towards understanding the process of galaxy formation and evolution. To obtai...
Jin Li, Xin Yao, Colin Frayn, Habib G. Khosroshahi...