Sciweavers

6300 search results - page 197 / 1260
» We have it easy, but do we have it right
Sort
View
GC
2010
Springer
15 years 3 days ago
20 Years of Negami's Planar Cover Conjecture
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
Petr Hlinený
ICRA
2010
IEEE
134views Robotics» more  ICRA 2010»
15 years 2 days ago
HRP-2 plays the yoyo: From human to humanoid yoyo playing using optimal control
— Yoyo playing may seem easy for a human, but it is a challenging problem for a humanoid robot. This paper presents an approach to generate yoyo motions for the humanoid robot, H...
Katja Mombaur, Manish N. Sreenivasa
PAIRING
2010
Springer
179views Cryptology» more  PAIRING 2010»
14 years 12 months ago
Deterministic Encoding and Hashing to Odd Hyperelliptic Curves
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y2 = f(x) where f is an odd polynomial. Hy...
Pierre-Alain Fouque, Mehdi Tibouchi
INLG
2010
Springer
14 years 11 months ago
Grouping Axioms for More Coherent Ontology Descriptions
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
Sandra Williams, Richard Power
GI
2009
Springer
14 years 11 months ago
Project Planning Support by Model Checking
Abstract: Today's trend in software and system engineering is to utilize more specialized models. This model-based development approach makes a single engineering task more ea...
Björn Axenath, Oliver Sudmann