179 search results - page 15 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
101
click to vote
COLOGNETWENTE
2008
15 years 1 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
145
click to vote
MOBICOM
1999
ACM
15 years 3 months ago
1999
ACM
An ad-hoc network is the cooperative engagement of a collection of typically wireless mobile nodes without the required intervention of any centralized access point or existing ...
122
Voted
WWW
2005
ACM
16 years 8 days ago
2005
ACM
We describe Thresher, a system that lets non-technical users teach their browsers how to extract semantic web content from HTML documents on the World Wide Web. Users specify exam...
ALGORITHMICA
2008
14 years 11 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
103
Voted
JUCS
2010
14 years 10 months ago
2010
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...