41 search results - page 6 / 9 » Trees of extremal connectivity index |
COMPGEOM
1990
ACM
13 years 11 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
MASCOTS
2003
13 years 8 months ago
2003
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
NAACL
2010
13 years 5 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
CIKM
2000
Springer
13 years 11 months ago
2000
Springer
The complexity of deploying high-performance spatial structures in transactional DBMS environments has motivated researchers to experiment with the idea of reusing the effort inve...
CGF
2008
13 years 7 months ago
2008
We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices...