1297 search results - page 3 / 260 » fews 2007 |
JCT
2007
14 years 9 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
RSS
2007
14 years 11 months ago
2007
— This paper considers the problem of controlling a group of agents under the constraint that every agent must be given the same control input. This problem is relevant for the c...
EJC
2007
14 years 9 months ago
2007
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mi...
CGF
2007
14 years 9 months ago
2007
We introduce a new appearance-modeling paradigm for synthesizing the internal structure of a 3D model from photographs of a few cross-sections of a real object. When the internal ...
98
Voted
OPODIS
2007
14 years 11 months ago
2007
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...