Sciweavers

6142 search results - page 155 / 1229
» The Complexity of Partition Functions
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
15 years 1 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 7 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
CORR
2010
Springer
158views Education» more  CORR 2010»
15 years 1 days ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
RECOMB
2007
Springer
16 years 3 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
BMCBI
2005
92views more  BMCBI 2005»
15 years 3 months ago
Predicting functional sites with an automated algorithm suitable for heterogeneous datasets
Background: In a previous report (La et al., Proteins, 2005), we have demonstrated that the identification of phylogenetic motifs, protein sequence fragments conserving the overal...
David La, Dennis R. Livesay