1092 search results - page 116 / 219 » Convex Methods for Transduction |
HYBRID
2000
Springer
15 years 1 months ago
2000
Springer
In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is de ned by linear di erential equatio...
RT
2000
Springer
15 years 1 months ago
2000
Springer
Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing ...
AIPS
2004
14 years 11 months ago
2004
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
NIPS
2004
14 years 11 months ago
2004
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distributio...
NIPS
2001
14 years 11 months ago
2001
When constructing a classifier, the probability of correct classification of future data points should be maximized. In the current paper this desideratum is translated in a very ...