Sciweavers

69 search results - page 2 / 14
» 2-factors with the bounded number of components in line grap...
Sort
View
CCCG
2004
13 years 5 months ago
On the number of line tangents to four triangles in three-dimensional space
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
Hervé Brönnimann, Olivier Devillers, S...
TSP
2010
12 years 10 months ago
Independent component analysis by entropy bound minimization
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
Xi-Lin Li, Tülay Adali
LICS
1991
IEEE
13 years 7 months ago
On the Deduction Rule and the Number of Proof Lines
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
Maria Luisa Bonet, Samuel R. Buss
COMPGEOM
2004
ACM
13 years 9 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
GD
2003
Springer
13 years 8 months ago
Track Drawings of Graphs with Constant Queue Number
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
Emilio Di Giacomo, Henk Meijer