Sciweavers

2432 search results - page 7 / 487
» Degrees and choice numbers
Sort
View
CSDA
2008
80views more  CSDA 2008»
13 years 7 months ago
Variational Bayesian functional PCA
A Bayesian approach to analyze the modes of variation in a set of curves is suggested. It is based on a generative model thus allowing for noisy and sparse observations of curves....
Angelika van der Linde
JGT
2007
99views more  JGT 2007»
13 years 7 months ago
The upper bound of the number of cycles in a 2-factor of a line graph
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-fa...
Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, She...
ICRA
1993
IEEE
184views Robotics» more  ICRA 1993»
13 years 11 months ago
The Kinematic Design of a 3-dof Isotropic Mobile Robot
Automatic guided vehicles with omnidirectional wheels have three degrees of freedom (DOF), their full mobility being obtained by virtue of the free rollers around the periphery of...
Subir Kumar Saha, Jorge Angeles, John Darcovich
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
14 years 22 days ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
NETWORKS
2008
13 years 7 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...