Sciweavers

24 search results - page 1 / 5
» Densification arising from sampling fixed graphs
Sort
View
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 4 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
ICPR
2010
IEEE
13 years 11 months ago
A Graph Matching Algorithm using Data-Driven Markov Chain Monte Carlo Sampling
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
Jungmin Lee, Minsu Cho, Kyoung Mu Lee
INFOCOM
2003
IEEE
13 years 10 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
RTSS
2008
IEEE
13 years 11 months ago
Control-Driven Tasks: Modeling and Analysis
The standard design of control systems is based on the periodic sampling. Every period the data is read from the input, the control law is computed, and the output is written to t...
Manel Velasco, Pau Martí, Enrico Bini
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 5 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson