In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level....
Zaiqing Nie, Yuanzhi Zhang, Ji-Rong Wen, Wei-Ying ...
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
This paper describes a graph visualization method that attempts to aid the understanding of graphs by adding continuous local movement to graph diagrams. The paper includes a disc...
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...