114 search results - page 12 / 23 » Computing First And Follow Functions For Feature-Theoretic G... |
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
ECCV
2006
Springer
15 years 1 months ago
2006
Springer
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
BMCBI
2005
14 years 9 months ago
2005
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
SIAMCOMP
2010
14 years 8 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...