Sciweavers

1809 search results - page 66 / 362
» Weakly Computable Real Numbers
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 4 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
IPL
2006
110views more  IPL 2006»
14 years 12 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
ICML
2008
IEEE
16 years 20 days ago
Space-indexed dynamic programming: learning to follow trajectories
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...
J. Zico Kolter, Adam Coates, Andrew Y. Ng, Yi Gu, ...
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 12 days ago
User grouping behavior in online forums
Online forums represent one type of social media that is particularly rich for studying human behavior in information seeking and diffusing. The way users join communities is a re...
Xiaolin Shi, Jun Zhu, Rui Cai, Lei Zhang
MOC
2000
122views more  MOC 2000»
14 years 11 months ago
Explicit resolutions of cubic cusp singularities
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...
H. G. Grundman