Sciweavers

1883 search results - page 107 / 377
» Ordered theta graphs
Sort
View
AAAI
2004
13 years 9 months ago
A Correspondence Metric for Imitation
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...
R. Amit, Maja J. Mataric
DM
2008
55views more  DM 2008»
13 years 8 months ago
Improved pebbling bounds
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
Melody Chan, Anant P. Godbole
ITSSA
2006
91views more  ITSSA 2006»
13 years 7 months ago
Organization Detection Using Emergent Computing
: Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organizat...
Cyrille Bertelle, Antoine Dutot, Fréd&eacut...
JCT
2006
73views more  JCT 2006»
13 years 7 months ago
Colouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
STACS
2009
Springer
14 years 2 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...