Sciweavers

2767 search results - page 391 / 554
» Universal Exponentiation Algorithm
Sort
View
CAGD
2006
97views more  CAGD 2006»
13 years 9 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
ENTCS
2006
151views more  ENTCS 2006»
13 years 9 months ago
Extending C for Checking Shape Safety
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
Mike Dodds, Detlef Plump
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 9 months ago
Kinematic calibration of orthoglide-type mechanisms
: The paper proposes a novel calibration approach for the Orthoglide-type mechanisms based on observations of the manipulator leg parallelism during motions between the prespecifie...
Anatoly Pashkevich, Damien Chablat, Philippe Wenge...
JGT
2006
60views more  JGT 2006»
13 years 9 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
JSS
2007
123views more  JSS 2007»
13 years 9 months ago
Do programmer pairs make different mistakes than solo programmers?
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
Matthias M. Müller