Sciweavers

WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 5 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of vâ...
John E. Hopcroft, Daniel Sheldon
WAW
2007
Springer
77views Algorithms» more  WAW 2007»
14 years 5 months ago
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
Sreenivas Gollapudi, Marc Najork, Rina Panigrahy
WAW
2007
Springer
89views Algorithms» more  WAW 2007»
14 years 5 months ago
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati...
Abraham D. Flaxman, Juan Vera
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
14 years 5 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 5 months ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 5 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
WAW
2007
Springer
133views Algorithms» more  WAW 2007»
14 years 5 months ago
Distribution of PageRank Mass Among Principle Components of the Web
We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank ...
Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham
WAOA
2007
Springer
106views Algorithms» more  WAOA 2007»
14 years 5 months ago
Full and Local Information in Distributed Decision Making
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
Panagiota N. Panagopoulou, Paul G. Spirakis
WAOA
2007
Springer
120views Algorithms» more  WAOA 2007»
14 years 5 months ago
A Randomized Algorithm for Two Servers in Cross Polytope Spaces
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawre...
WAOA
2007
Springer
103views Algorithms» more  WAOA 2007»
14 years 5 months ago
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
How should a seller price his goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his bud...
Robert Krauthgamer, Aranyak Mehta, Atri Rudra