Sciweavers

13 search results - page 1 / 3
» Partition-Based Block Matching of Large Class Hierarchies
Sort
View
ASWC
2006
Springer
13 years 8 months ago
Partition-Based Block Matching of Large Class Hierarchies
Abstract. Ontology matching is a crucial task of enabling interoperation between Web applications using different but related ontologies. Due to the size and the monolithic nature,...
Wei Hu, Yuanyuan Zhao, Yuzhong Qu
TON
1998
71views more  TON 1998»
13 years 4 months ago
Real-time block transfer under a link-sharing hierarchy
— Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and lo...
Geoffrey G. Xie, Simon S. Lam
GRAPHICSINTERFACE
2009
13 years 2 months ago
Structural differences between two graphs through hierarchies
This paper presents a technique for visualizing the differences between two graphs. The technique assumes that a unique labeling of the nodes for each graph is available, where if...
Daniel Archambault
CVPR
2007
IEEE
14 years 6 months ago
Towards Scalable Representations of Object Categories: Learning a Hierarchy of Parts
This paper proposes a novel approach to constructing a hierarchical representation of visual input that aims to enable recognition and detection of a large number of object catego...
Sanja Fidler, Ales Leonardis
PODS
1993
ACM
161views Database» more  PODS 1993»
13 years 8 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...