185 search results - page 12 / 37 » Invariants, Modularity, and Rights |
DM
1999
13 years 7 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
RAS
2006
13 years 7 months ago
2006
The Scale Invariant Feature Transform, SIFT, has been successfully applied to robot localization. Still, the number of features extracted with this approach is immense, especially...
WG
1995
Springer
13 years 11 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...
AUTOMATICA
2007
13 years 7 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...