Sciweavers

58 search results - page 7 / 12
» Induced Ramsey-type theorems
Sort
View
ICRA
2009
IEEE
178views Robotics» more  ICRA 2009»
13 years 5 months ago
A riemannian-geometry approach for dynamics and control of object manipulation under constraints
A Riemannian-geometry approach for control and stabilization of dynamics of object manipulation under holonomic or non-holonomic (but Pfaffian) constraints is presented. First, pos...
Suguru Arimoto, Morio Yoshida, Masahiro Sekimoto, ...
DLT
2008
13 years 8 months ago
Relationally Periodic Sequences and Subword Complexity
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni
COLT
2007
Springer
13 years 11 months ago
Robust Reductions from Ranking to Classification
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
Maria-Florina Balcan, Nikhil Bansal, Alina Beygelz...
JAC
2008
13 years 8 months ago
Topological properties of sand automata as cellular automata
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology f...
Alberto Dennunzio, Pierre Guillon, Benoît Ma...
DM
2008
95views more  DM 2008»
13 years 7 months ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...