Sciweavers

36781 search results - page 105 / 7357
» Parameterizing by the Number of Numbers
Sort
View
CCCG
2004
13 years 11 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...
CCCG
1997
13 years 11 months ago
On the number of internal and external visibility edges of polygons
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
Jorge Urrutia
WSC
1998
13 years 11 months ago
Bayesian Model Selection when the Number of Components is Unknown
In simulation modeling and analysis, there are two situations where there is uncertainty about the number of parameters needed to specify a model. The first is in input modeling w...
Russell C. H. Cheng
EJC
2008
13 years 10 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
EJC
2008
13 years 10 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar