401 search results - page 61 / 81 » Sparse Quasi-Random Graphs |
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
PRL
2010
13 years 6 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Book
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...