4137 search results - page 226 / 828 » On the number of matchings of a tree |
164
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
200
click to vote
ICDT
2012
ACM
13 years 9 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
166
click to vote
MICCAI
2004
Springer
16 years 7 months ago
2004
Springer
We previously presented a HAMMER image registration algorithm that demonstrated high accuracy in superposition of images from different individual brains. However, the HAMMER regis...
156
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
176
click to vote
CCGRID
2006
IEEE
16 years 22 days ago
2006
IEEE
Making effective use of computational Grids requires scheduling Grid applications onto resources that best match them. Resource-related state (e.g., load, availability, and locati...