Sciweavers

416 search results - page 13 / 84
» Correcting a Space-Efficient Simulation Algorithm
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
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 ...
Philip M. Long, Rocco A. Servedio
QSIC
2005
IEEE
14 years 27 days ago
Stochastic Voting Algorithms for Web Services Group Testing
This paper proposes a stochastic voting for testing a large number of Web Services (WS) under group testing. In the future, a large number of WS will be available and they need to...
Wei-Tek Tsai, Dawei Zhang, Raymond A. Paul, Yinong...
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
14 years 21 days ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
CAV
2009
Springer
187views Hardware» more  CAV 2009»
14 years 7 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
DASFAA
2004
IEEE
87views Database» more  DASFAA 2004»
13 years 11 months ago
UB-Tree Based Efficient Predicate Index with Dimension Transform for Pub/Sub System
For event filtering of publish/subscribe system, significant research efforts have been dedicated to techniques based on multiple one-dimensional indexes built on attributes of sub...
Botao Wang, Wang Zhang, Masaru Kitsuregawa