668 search results - page 67 / 134 » Algorithmics and Applications of Tree and Graph Searching |
113
Voted
SEMWEB
2007
Springer
15 years 8 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
104
click to vote
CPAIOR
2010
Springer
15 years 7 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
131
Voted
DEXA
2008
Springer
15 years 4 months ago
2008
Springer
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
146
click to vote
INFOCOM
2010
IEEE
15 years 14 days ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
130
Voted
DEXA
2010
Springer
15 years 2 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...