Sciweavers

958 search results - page 35 / 192
» Resolving the Micropayment Problem
Sort
View
NECO
2008
146views more  NECO 2008»
14 years 9 months ago
Deep, Narrow Sigmoid Belief Networks Are Universal Approximators
In this paper we show that exponentially deep belief networks [3, 7, 4] can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each lay...
Ilya Sutskever, Geoffrey E. Hinton
FSTTCS
2010
Springer
14 years 7 months ago
Model Checking Concurrent Programs with Nondeterminism and Randomization
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
CVPR
2006
IEEE
15 years 12 months ago
Shape from Shading: Recognizing the Mountains through a Global View
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
Qihui Zhu, Jianbo Shi
JNCA
2008
103views more  JNCA 2008»
14 years 9 months ago
Congestion control of bluetooth radio system by piconet restructuring
Bluetooth is a low-cost and short-range wireless communication technology. Two or more bluetooth devices connected form a piconet and two or more piconets connected form a scatter...
Gwo-Jong Yu, Chih-Yung Chang
POPL
2002
ACM
15 years 10 months ago
The first-order theory of subtyping constraints
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...