966 search results - page 104 / 194 » Small Alliances in Graphs |
MICCAI
2005
Springer
14 years 11 months ago
2005
Springer
Shape priors attempt to represent biological variations within a population. When variations are global, Principal Component Analysis (PCA) can be used to learn major modes of vari...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
IMR
2003
Springer
14 years 3 months ago
2003
Springer
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...
STOC
1992
ACM
14 years 2 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
IJAC
2007
13 years 10 months ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...