Sciweavers

1058 search results - page 53 / 212
» It's Doomed; We Can Prove It
Sort
View
CN
2007
95views more  CN 2007»
13 years 10 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...
TCS
2002
13 years 9 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
FMSD
2000
80views more  FMSD 2000»
13 years 9 months ago
Delay-Insensitivity and Semi-Modularity
The study of asynchronous circuit behaviors in the presence of component and wire delays has received a great deal of attention. In this paper, we consider asynchronous circuits wh...
Janusz A. Brzozowski, Hao Zhang 0002
POPL
2002
ACM
14 years 10 months ago
Adaptive functional programming
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
Umut A. Acar, Guy E. Blelloch, Robert Harper
PODS
2006
ACM
127views Database» more  PODS 2006»
14 years 10 months ago
Evolution of page popularity under random web graph models
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
Rajeev Motwani, Ying Xu 0002