Sciweavers

511 search results - page 42 / 103
» Lower bounds for distributed markov chain problems
Sort
View
MST
2011
205views Hardware» more  MST 2011»
13 years 2 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...
CPAIOR
2008
Springer
13 years 9 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 9 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
JCST
2010
139views more  JCST 2010»
13 years 6 months ago
Dirichlet Process Gaussian Mixture Models: Choice of the Base Distribution
In the Bayesian mixture modeling framework it is possible to infer the necessary number of components to model the data and therefore it is unnecessary to explicitly restrict the n...
Dilan Görür, Carl Edward Rasmussen
INFOCOM
2010
IEEE
13 years 5 months ago
Distributed Coordination with Deaf Neighbors: Efficient Medium Access for 60 GHz Mesh Networks
Multi-gigabit outdoor mesh networks operating in the unlicensed 60 GHz "millimeter (mm) wave" band, offer the possibility of a quickly deployable broadband extension of t...
Sumit Singh, Raghuraman Mudumbai, Upamanyu Madhow