3008 search results - page 87 / 602 » Independence in connected graphs |
181
click to vote
TC
1998
15 years 6 months ago
1998
—Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distribut...
165
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
151
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
209
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a novel formulation of stereo matching that considers each pixel as a feature vector. Under this view, matching two or more images can be cast as matching point clouds i...
192
click to vote
ECOWS
2007
Springer
16 years 15 days ago
2007
Springer
Dynamic composition of web services is a promising approach and at the same time a challenging research area for the dissemination of serviceoriented applications. It is widely rec...