Sciweavers

733 search results - page 72 / 147
» Recommending random walks
Sort
View
STACS
2007
Springer
15 years 3 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Robert Elsässer, Thomas Sauerwald
SIGIR
2006
ACM
15 years 3 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
CHES
2004
Springer
99views Cryptology» more  CHES 2004»
15 years 3 months ago
Defeating Countermeasures Based on Randomized BSD Representations
Abstract. The recent development of side channel attacks has lead implementers to use increasingly sophisticated countermeasures in critical operations such as modular exponentiati...
Pierre-Alain Fouque, Frédéric Muller...
INFOCOM
2005
IEEE
15 years 3 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic
CSR
2007
Springer
15 years 4 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka