1127 search results - page 23 / 226 » Testing the Expansion of a Graph |
TVCG
2010
14 years 10 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
DELTA
2002
IEEE
15 years 4 months ago
2002
IEEE
The European network for Integrated Circuit testing education described in this paper addresses the shortage of skill in mixed-signal production testing by encouraging students...
105
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
COMBINATORICA
2007
14 years 11 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...