Sciweavers

268 search results - page 50 / 54
» Mixing time for the solid-on-solid model
Sort
View
BMCBI
2010
191views more  BMCBI 2010»
13 years 8 months ago
Colonyzer: automated quantification of micro-organism growth characteristics on solid agar
Background: High-throughput screens comparing growth rates of arrays of distinct micro-organism cultures on solid agar are useful, rapid methods of quantifying genetic interaction...
Conor Lawless, Darren J. Wilkinson, Alexander Youn...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 8 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
INFOCOM
2005
IEEE
14 years 2 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 21 days ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
13 years 8 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price