29 search results - page 6 / 6 » The b-Chromatic Number of Cubic Graphs |
147
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
106
Voted
ICALP
1992
Springer
15 years 5 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
109
Voted
IJCAI
1989
15 years 2 months ago
1989
We extend qualitative reasoning with estimations of the relative likelihoods of the pos sible qualitative behaviors . We estimate the likelihoods by viewing the dynamics o f a sys...
103
Voted
PAMI
1998
15 years 23 days ago
1998
A new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is to rst extract a low-d...