Sciweavers

193 search results - page 38 / 39
» Duality in Infinite Graphs
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
15 years 9 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan
CSUR
1999
159views more  CSUR 1999»
14 years 9 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
WWW
2008
ACM
15 years 10 months ago
IRLbot: scaling to 6 billion pages and beyond
This paper shares our experience in designing a web crawler that can download billions of pages using a single-server implementation and models its performance. We show that with ...
Hsin-Tsang Lee, Derek Leonard, Xiaoming Wang, Dmit...
RTCSA
1999
IEEE
15 years 1 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer