8298 search results - page 345 / 1660 » On the Complexity of Numerical Analysis |
212
click to vote
COLT
2005
Springer
16 years 1 months ago
2005
Springer
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
172
click to vote
TGC
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We present a formal system that models programmable abstractions for access control. Composite abstractions and patterns of arbitrary complexity are modeled as a configu...
171
click to vote
ITC
1994
IEEE
15 years 11 months ago
1994
IEEE
For obtaining a zero defect level, a high fault coverage with respect to the stuck-at fault model is often not sufficient as there are many defects that show a more complex behavi...
199
click to vote
AAAI
1994
15 years 8 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
189
click to vote
ENVSOFT
2006
15 years 7 months ago
2006
We present a set of models for simulating vegetation dynamics in disturbance-prone ecosystems with different complexity levels, integrated in a modelling environment for generatin...