Sciweavers

1434 search results - page 43 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ICALP
2009
Springer
14 years 2 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
14 years 1 months ago
A Probabilistic Graphical Approach to Computing Electricity Price Duration Curves under Price and Quantity Competition
Abstract— The electricity price duration curve (EPDC) represents the probability distribution function of the electricity price considered as a random variable. The price uncerta...
Pascal Michaillat, Shmuel S. Oren
VLSM
2005
Springer
14 years 1 months ago
Entropy Controlled Gauss-Markov Random Measure Field Models for Early Vision
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
Mariano Rivera, Omar Ocegueda, José L. Marr...
FOCS
2003
IEEE
14 years 27 days ago
A Non-Markovian Coupling for Randomly Sampling Colorings
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
Thomas P. Hayes, Eric Vigoda