Filters: First Letter Of Keyword is O [Clear All Filters]
Statistical physics, optimization and source coding. Pramana. 2005;64:1161-73.
Survey Propagation as local equilibrium equations. Journal of Statistical Mechanics: Theory and Experiment. 2004;6:P06007.
Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions. eprint arXiv: 0709.1190. 2007.
Stochastic optimization by message passing. JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT. 2011;2011.
Computational complexity from characteristic phase transitions. Nature. 1999;400:133.
Two solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys.. 2002;111:505.
Efficient supervised learning in networks with binary synapses. Proceedings of the National Academy of Sciences. 2007;104:11079-84.
Entropy landscape and non-Gibbs solutions in constraint satisfaction problems. Physical Review E. 2008;77:31118.
Statistical Mechanics of Steiner Trees. Physical Review Letters. 2008;101:37208.
Survey and belief propagation on random k-sat. Lecture Notes in Computer Science. 2004;2919:519-28.
On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs. Journal of Statistical Mechanics: Theory and Experiment. 2008;2008:L06001.
A Prize-Collecting Steiner Tree Approach for Transduction Network Inference. In: Proceedings of the 7th International Conference on Computational Methods in Systems Biology. Springer; 2009. 95.
Elastic properties of small-world spring networks. Physical Review E. 2005;72:66115.
Coloring Random Graphs. Physical Review Letters. 2002;89:268701.
Survey-propagation decimation through distributed local computations. J. Stat. Mech.. 2005:P11016.
Spanning trees in random satisfiability problems. Journal of Physics A: Mathematical and General. 2006;39:4901-9.
Optimizing Searches via Rare Events. Physical Review Letters. 2002;88:178701.
From Statistical Methods to Algorithms. Int. J. Mod. Phys. B. 2006;20:2814-23.
Biased random satisfiability problems: From easy to hard instances. Physical Review E. 2005;71:66101.
Pairs of SAT Assignments and Clustering in Random Boolean Formulae. Theoretical Computer Science. 2008;393:260-79.
Learning by message-passing in networks of discrete synapses. Phys. Rev. Lett.. 2006;96:030201.
Simplifying random satisfiability problems by removing frustrating interactions. Physical Review E. 2006;74:41105.
Two Solutions to Diluted p-Spin Models and XORSAT Problems. Journal of Statistical Physics. 2003;111:505-33.