Sciweavers

99 search results - page 11 / 20
» On a subclass of close-to-convex functions
Sort
View
IJCAI
1993
13 years 11 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
AUTOMATICA
2008
152views more  AUTOMATICA 2008»
13 years 10 months ago
A design methodology for switched discrete time linear systems with applications to automotive roll dynamics control
In this paper we consider the asymptotic stability of a class of discrete-time switching linear systems, where each of the constituent subsystems is Schur stable. We first present...
Selim Solmaz, Robert Shorten, Kai Wulff, Fiacre &O...
ICALP
2009
Springer
14 years 10 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong
VMV
2000
119views Visualization» more  VMV 2000»
13 years 11 months ago
Orientation Estimation Based on Weighted Projection onto Quadratic Polynomials
Essentially all Computer Vision strategies require initial computation of orientation structure or motion estimation. Although much work has been invested in this subfield, method...
Gunnar Farnebäck
ICML
1996
IEEE
14 years 10 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore