723 search results - page 11 / 145 » On the hyperbolicity constant in graphs |
APPROX
2005
Springer
14 years 29 days ago
2005
Springer
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
STOC
1990
ACM
13 years 11 months ago
1990
ACM
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
DAC
2004
ACM
14 years 8 months ago
2004
ACM
An important primitive in the hardware implementations of linear DSP transforms is a circuit that can multiply an input value by one of several different preset constants. We prop...