Results 1  10
of
258,214
Indegree and PageRank: Why do they follow similar power laws
"... PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as InDegree values. This paper presents a novel mathematical model that explains this phenomenon. The relation between PageRank and InDegree is mo ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as InDegree values. This paper presents a novel mathematical model that explains this phenomenon. The relation between PageRank and InDegree
TopicSensitive PageRank
, 2002
"... In the original PageRank algorithm for improving the ranking of searchquery results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search resu ..."
Abstract

Cited by 535 (10 self)
 Add to MetaCart
In the original PageRank algorithm for improving the ranking of searchquery results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search
InDegree and PageRank of Web Pages: Why Do They Follow Similar Power Laws?” Memorandum 1807, Dept
 of Applied Math., Univ. of Twente
, 2006
"... The PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that the PageRank obeys a ‘power law ’ with the same exponent as the InDegree. This paper presents a novel mathematical model that explains this phenomenon. The relation between the PageRank and InDegree ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that the PageRank obeys a ‘power law ’ with the same exponent as the InDegree. This paper presents a novel mathematical model that explains this phenomenon. The relation between the PageRank and InDegree
ISSN 01692690InDegree and PageRank of Web pages:
, 2006
"... www.math.utwente.nl/publications ..."
Local Approximation of PageRank and Reverse PageRank
"... We consider the problem of approximating the PageRank of a target node using only local information provided by a link server. This problem was originally studied by Chen, Gan, and Suel (CIKM 2004), who presented an algorithm for tackling it. We prove that local approximation of PageRank, even to wi ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
. On the other hand, reverse natural graphs tend to have low indegree while maintaining fast PageRank convergence. It follows that calculating Reverse PageRank locally is frequently more feasible than computing PageRank locally. We demonstrate that Reverse PageRank is useful for several applications, including
Powerlaw distributions in empirical data
 ISSN 00361445. doi: 10.1137/ 070710111. URL http://dx.doi.org/10.1137/070710111
, 2009
"... Powerlaw distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and manmade phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur in the t ..."
Abstract

Cited by 589 (7 self)
 Add to MetaCart
estimates for powerlaw data, based on maximum likelihood methods and the KolmogorovSmirnov statistic. We also show how to tell whether the data follow a powerlaw distribution at all, defining quantitative measures that indicate when the power law is a reasonable fit to the data and when it is not. We
Using PageRank to Characterize Web Structure
"... Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on “local” properties of the web graph, we study the distribution of PageRank values on the web. Our measurements suggest that PageRank value ..."
Abstract

Cited by 114 (0 self)
 Add to MetaCart
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on “local” properties of the web graph, we study the distribution of PageRank values on the web. Our measurements suggest that PageRank
Manufacturing Firms in Developing Countries: How Well do they do and Why
 Journal of Economic Literature
, 2000
"... The manufacturing sectors of less developed countries (LDCs) have traditionally been relatively protected. They have also been subject to heavy regulation, much of which is biased in favor of large enterprises. Accordingly, it is often argued that manufacturers in these countries perform poorly in s ..."
Abstract

Cited by 370 (9 self)
 Add to MetaCart
in several respects: (1) markets tolerate inefficient firms, so crossfirm productivity dispersion is high; (2) small groups of entrenched oligopolists exploit monopoly power in product markets; and (3) many small firms are unable or unwilling to grow, so important scale economies go unexploited
Heuristic Evaluation of User Interfaces
 IN: PROCEEDINGS OF THE CHI´90 CONFERENCE, SEATTLE
, 1990
"... Heuristic evaluation is an informal method of usability analysis where a number of evaluators are presented with an interface design and asked to comment on it. Four experiments showed that individual evaluators were mostly quite bad at doing such heuristic evaluations and that they only found betw ..."
Abstract

Cited by 502 (4 self)
 Add to MetaCart
Heuristic evaluation is an informal method of usability analysis where a number of evaluators are presented with an interface design and asked to comment on it. Four experiments showed that individual evaluators were mostly quite bad at doing such heuristic evaluations and that they only found
Tinydb: An acquisitional query processing system for sensor networks
 ACM Trans. Database Syst
, 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract

Cited by 609 (8 self)
 Add to MetaCart
, and execution. We evaluate these issues in the context of TinyDB, a distributed query processor for smart sensor devices, and show how acquisitional techniques can provide significant reductions in power consumption on our sensor devices. Categories and Subject Descriptors: H.2.3 [Database Management
Results 1  10
of
258,214