Sciweavers

320 search results - page 21 / 64
» Rigorous Result for the CHKNS Random Graph Model
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 2 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
RSA
2006
104views more  RSA 2006»
13 years 8 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 10 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
RSA
2010
107views more  RSA 2010»
13 years 7 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
ER
2005
Springer
186views Database» more  ER 2005»
14 years 2 months ago
Blueprints and Measures for ETL Workflows
Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. Previous ...
Panos Vassiliadis, Alkis Simitsis, Manolis Terrovi...