Sciweavers

1629 search results - page 294 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
MOBIWAC
2009
ACM
15 years 4 months ago
The sociable traveller: human travelling patterns in social-based mobility
Understanding how humans move is a key factor for the design and evaluation of networking protocols and mobility management solutions in mobile networks. This is particularly true...
Chiara Boldrini, Marco Conti, Andrea Passarella
CF
2005
ACM
14 years 11 months ago
A case for a working-set-based memory hierarchy
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder
CIKM
2006
Springer
15 years 1 months ago
A probabilistic relevance propagation model for hypertext retrieval
A major challenge in developing models for hypertext retrieval is to effectively combine content information with the link structure available in hypertext collections. Although s...
Azadeh Shakery, ChengXiang Zhai
INFOCOM
2006
IEEE
15 years 3 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz
PODC
2005
ACM
15 years 3 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder