Sciweavers

4067 search results - page 51 / 814
» Programs for Applying Symmetries
Sort
View
RSA
2008
123views more  RSA 2008»
13 years 7 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ICPR
2000
IEEE
14 years 9 months ago
Glasses Detection and Extraction by Deformable Contour
To achieve a face recognition system robust to the presence of glasses, we have developped a glasses detection and extraction algorithm. Detection is realized using edge informati...
Zhong Jing, Robert Mariani
CAEPIA
2003
Springer
14 years 1 months ago
Generating Random Orthogonal Polygons
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
Ana Paula Tomás, António Leslie Baju...
JAR
1998
60views more  JAR 1998»
13 years 7 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
ECRTS
2005
IEEE
14 years 1 months ago
Applying Static WCET Analysis to Automotive Communication Software
The number of embedded computers used in modern cars have increased dramatically during the last years, as they provide increased functionality to a reduced cost compared to previ...
Susanna Byhlin, Andreas Ermedahl, Jan Gustafsson, ...