Sciweavers

4403 search results - page 320 / 881
» Galois Theory of Algorithms
Sort
View
WWW
2004
ACM
16 years 7 months ago
Ranking the web frontier
The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into...
Nadav Eiron, Kevin S. McCurley, John A. Tomlin
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 7 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
KDD
2009
ACM
182views Data Mining» more  KDD 2009»
16 years 7 months ago
Scalable graph clustering using stochastic flows: applications to community discovery
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Venu Satuluri, Srinivasan Parthasarathy
MOBIHOC
2006
ACM
16 years 6 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
MOBIHOC
2006
ACM
16 years 6 months ago
Robust distributed node localization with error management
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
Juan Liu, Ying Zhang, Feng Zhao