Sciweavers

421 search results - page 68 / 85
» A Survey of Models of the Web Graph
Sort
View
EPEW
2005
Springer
14 years 28 days ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
SIGMETRICS
2000
ACM
125views Hardware» more  SIGMETRICS 2000»
13 years 7 months ago
Resource management policies for e-commerce servers
Quality of service of e-commerce sites has been usually managed by the allocation of resources such as processors, disks, and network bandwidth, and by tracking conventional perfo...
Daniel A. Menascé, Rodrigo C. Fonseca, Virg...
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
14 years 8 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...
WWW
2004
ACM
14 years 8 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
ESWS
2009
Springer
13 years 5 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
Jonas Tappolet, Abraham Bernstein