Sciweavers

81 search results - page 9 / 17
» Bounding the Partition Function of Spin-Systems
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
ICDCN
2011
Springer
12 years 12 months ago
Reliable Networks with Unreliable Sensors
Abstract. Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network conn...
Srikanth Sastry, Tsvetomira Radeva, Jianer Chen, J...
RECOMB
2007
Springer
14 years 8 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
COMPGEOM
2003
ACM
14 years 1 months ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
DAGSTUHL
2007
13 years 10 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin