Abstract: An efficient implicit representation of an n-vertex graph G in a family $\mathcal{F}$ of graphs assigns to each vertex of G a binary code of length O(log n) so that the adjacency between ...
Abstract: API recommendation methods have evolved from literal and semantic keyword matching to query expansion and query clarification. The latest query clarification method is knowledge graph ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback