Sciweavers

1403 search results - page 17 / 281
» About Approximations of Exponentials
Sort
View
81
Voted
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
MOC
2002
92views more  MOC 2002»
14 years 9 months ago
Asymptotic properties of the spectral test, diaphony, and related quantities
This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The re...
Hannes Leeb
HEURISTICS
2006
95views more  HEURISTICS 2006»
14 years 9 months ago
Hard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
Carmel Domshlak, Steven David Prestwich, Francesca...
AAAI
1990
14 years 10 months ago
An Approach to Reasoning About Continuous Change for Applications in Planning
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
Thomas Dean, Greg Siegle
ICC
2007
IEEE
103views Communications» more  ICC 2007»
15 years 3 months ago
Modeling Channel Occupancy Times for Voice Traffic in Cellular Networks
—Call holding times in telephony networks are commonly approximated by exponential distributions to facilitate traffic engineering. However, for traffic engineering of cellular n...
Emre A. Yavuz, Victor C. M. Leung