Sciweavers

3220 search results - page 125 / 644
» Constrained Graph Processes
Sort
View
ICCS
2003
Springer
15 years 3 months ago
A Semantic Search Approach by Graph Matching with Negations and Inferences
Research on semantic search has become heated these years. In this paper we propose an approach focusing on searching for resources with descriptions. The knowledge representation ...
Kewei Tu, Jing Lu, Haiping Zhu, Guowei Liu, Yong Y...
TVCG
2008
119views more  TVCG 2008»
14 years 10 months ago
Exploration of Networks using overview+detail with Constraint-based cooperative layout
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. ...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
15 years 11 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
ACL
1998
14 years 11 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber
GBRPR
2007
Springer
15 years 4 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke