503 search results - page 62 / 101 » Verifying Quantitative Properties Using Bound Functions |
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— This paper considers networks consisting of integral input-to-state stable (iISS) subsystems and addresses the problem of verifying iISS property of a given network. First, we ...
IWANN
2001
Springer
15 years 2 months ago
2001
Springer
This paper proposes the general paradigm to build Q'tron neural networks (NNs) for visual cryptography. Given a visual encryption scheme, usually described using an access st...
NIPS
2008
14 years 11 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
102
click to vote
ML
2008
ACM
14 years 9 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
APWEB
2009
Springer
15 years 1 months ago
2009
Springer
We present a new method to evaluate a search ontology, which relies on mapping ontology instances to textual documents. On the basis of this mapping, we evaluate the adequacy of on...