159 search results - page 2 / 32 » Incremental One-Class Learning with Bounded Computational Co... |
119
Voted
STOC
1993
ACM
15 years 5 months ago
1993
ACM
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...
111
click to vote
AIPS
2004
15 years 2 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
220
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
97
Voted
TCS
1998
15 years 23 days ago
1998
134
Voted
JMLR
2012
13 years 3 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...